Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2013

Highly Cited

2013

GPS (for Graph Processing System) is a complete open-source system we developed for scalable, fault-tolerant, and easy-to-program… Expand

Highly Cited

2011

Highly Cited

2011

In this paper, we provide a theoretical framework for controlling graph connectivity in mobile robot networks. We discuss… Expand

Highly Cited

2008

Highly Cited

2008

We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space… Expand

Review

2007

Review

2007

The emerging area of control with limited data rates incorporates ideas from both control and information theory. The data rate… Expand

Highly Cited

2006

Highly Cited

2006

We investigate the problem of automatically labelling appearances of characters in TV or film material. This is tremendously… Expand

Highly Cited

2004

Highly Cited

2004

We consider a symmetric random walk on a connected graph, where each edge is labeled with the probability of transition between… Expand

Highly Cited

2000

Highly Cited

2000

Abstract For an ordered subset W={w1,w2,…,wk} of vertices in a connected graph G and a vertex v of G, the metric representation… Expand

Highly Cited

1997

Highly Cited

1997

We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a… Expand

Highly Cited

1991

Highly Cited

1991

Previous asymptotically correct algorithms for recovering causal structure from sample probabilities have been limited even in… Expand

Highly Cited

1965

Highly Cited

1965

A clique is a maximal complete subgraph of a graph. The maximum number of cliques possible in a graph withn nodes is determined… Expand