1986 search results - page 154 / 398 » Path Separability of Graphs |
DAM
2011
13 years 5 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
COMBINATORICA
2011
12 years 10 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— We explore the control synthesis problem for a robot dynamically manipulating an object in the presence of multiple frictional contacts. Contacts occur both between the object ...
ICDAR
2011
IEEE
12 years 9 months ago
2011
IEEE
—We propose a novel method to evaluate table segmentation results based on a table image ground truther. In the ground-truthing process, we first extract connected components fr...
CVPR
2006
IEEE
15 years 3 days ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...