Cycle (graph theory)

Known as: Cycle (graph), Simple cycle, Closed walk 
In graph theory, there are several different types of objects called cycles, principally a closed walk and a simple cycle; also, e.g., an element of… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1963-2018
05010019632018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Harmonic analysis of a one-year time series (26 periods) of NOAA AVHRR NDVI biweekly composite data was used to characterize… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
The concept of resilience has evolved considerably since Holling’s (1973) seminal paper. Different interpretations of what is… (More)
  • figure 1
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous computing platform. We… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Stochastic processes de ned on graphs arise in a tremendous variety of elds, including statistical physics, signal processing… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
INTRODUCTION WE DEVELOP here a generalization to singular spaces of the Poincare-Lefschetz theory of intersections of homology… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 3
  • figure 4
Is this relevant?
1997
1997
 If G is an n vertex maximal planar graph and δ≤1 3, then the vertex set of G can be partitioned into three sets A, B, C such… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper deals with approximating feedback sets in directed graphs. We consider two related problems: the weighted feedback… (More)
Is this relevant?
Highly Cited
1991
Highly Cited
1991
The Lovász Local Lemma is a tool that enables one to show that certain events hold with positive, though very small probability… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
We show that every 2-connected triangulated planar graph with n vertices has a simple cycle C of length at most 4@@@@n which… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
This paper first considers several types of additive bases. A typical problem is to find nv(k), the largest n for which there… (More)
  • table IV
  • table II
  • figure 1
  • figure 2
  • figure 3
Is this relevant?