# Loop (graph theory)

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2013

Highly Cited

2013

- IEEE Transactions on Circuits and Systems Iâ€¦
- 2013

Consider a weighted undirected graph and its corresponding Laplacian matrix, possibly augmented with additional diagonal elementsâ€¦Â (More)

Is this relevant?

2013

2013

- SIAM J. Comput.
- 2013

As existence result, it is well known that every 3-connected graph G = (V, E) on more than 4 vertices admits a sequence ofâ€¦Â (More)

Is this relevant?

2012

2012

- ArXiv
- 2012

The interactions between the components of complex networks are often directed. Proper modeling of such systems frequentlyâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- 2008

NetworkX is a Python language package for exploration and analysis of networks and network algorithms. The core package providesâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Business Proc. Manag. Journal
- 2007

Purpose â€“ The purpose of this paper is to demonstrate that process verification has matured to a level where it can be used inâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- International Journal of Document Analysis andâ€¦
- 2007

Language usage over computer mediated discourses, such as chats, emails and SMS texts, significantly differs from the standardâ€¦Â (More)

Is this relevant?

Highly Cited

2003

Highly Cited

2003

- Machine Learning
- 2003

Basket Analysis, which is a standard method for data mining, derives frequent itemsets from database. However, its mining abilityâ€¦Â (More)

Is this relevant?

1997

1997

- Inf. Process. Lett.
- 1997

Finite, undirected graphs without self-loops are considered in the paper. The goal is to nd a protocol for local computationâ€¦Â (More)

Is this relevant?

1997

1997

- 1997

In 1988, Leighton, Maggs and Rao proved a much celebrated result: that for any network, given any collection of packets with aâ€¦Â (More)

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Inf. Process. Lett.
- 1992

We consider finite graphs with no self-loops and no multiple edges. A graph is valid if all edges incident on a vertex haveâ€¦Â (More)

Is this relevant?