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)

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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Cyril Banino-Rokkones, Olivier Beaumont, Larry Carter, Jeanne Ferrante, Arnaud Legrand, Yves Robert
- IEEE Transactions on Parallel and Distributedâ€¦
- 2004

We consider the problem of allocating a large number of independent, equal-sized tasks to a heterogeneous computing platform. Weâ€¦Â (More)

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)

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)

Is this relevant?

1997

1997

- Hristo Djidjev, Shankar M. Venkatesan
- Acta Informatica
- 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)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- Guy Even, Joseph Naor, Baruch Schieber, Madhu Sudan
- Algorithmica
- 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

- Noga Alon
- FOCS
- 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

- Gary L. Miller
- STOC
- 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

- Ronald L. Graham, N. J. A. Sloane
- SIAM J. Matrix Analysis Applications
- 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)

Is this relevant?