Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
  • C. Altafini
  • IEEE Transactions on Automatic Control
  • 2013
  • Corpus ID: 156645
In a consensus protocol an agreement among agents is achieved thanks to the collaborative efforts of all agents, expresses by a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
2004
Highly Cited
2004
The concept of resilience has evolved considerably since Holling’s (1973) seminal paper. Different interpretations of what is… Expand
  • figure 1
  • figure 1
  • figure 2
Highly Cited
2004
Highly Cited
2004
  • Coarticulation • Suprasegmentals
  • 2004
  • Corpus ID: 17983056
teristics of speech. Speech consists of variations in air pressure that result from physical disturbances of air molecules caused… Expand
  • figure 1
Highly Cited
2002
Highly Cited
2002
We examine the dynamic formation and stochastic evolution of networks connecting individuals whose payoffs from an economic or… Expand
  • figure 2
  • figure 1
Highly Cited
1995
Highly Cited
1995
We describe a novel randomized method, the method of color-coding for finding simple paths and cycles of a specified length k… Expand
Highly Cited
1994
Highly Cited
1994
We propose an algorithm for combinatorial optimization where an explicit check for the repetition of configurations is added to… Expand
  • figure 1
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Highly Cited
1993
Highly Cited
1993
Climate over the past million years has been dominated by glaciation cycles with periods near 23,000, 41,000, and 100,000 years… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Highly Cited
1986
Highly Cited
1986
Traditional discrete-event simulations employ an inherently sequential algorithm. In practice, simulations of large systems are… Expand
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 4
Highly Cited
1980
Highly Cited
1980
INTRODUCTION WE DEVELOP here a generalization to singular spaces of the Poincare-Lefschetz theory of intersections of homology… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 3
  • figure 4
Highly Cited
1971
Highly Cited
1971
Abstract This paper is a study of the theoretical foundations of constitutive relations at finite strain for a class of solids… Expand