1986 search results - page 299 / 398 » Path Separability of Graphs |
115
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
A caterpillar is a tree in which all vertices of degree three or more lie on one path, called the backbone. We present a polynomial time algorithm that produces a linear arrangeme...
104
Voted
VLDB
2005
ACM
15 years 7 months ago
2005
ACM
A fundamental concern of information integration in an XML context is the ability to embed one or more source documents in a target document so that (a) the target document confor...
118
Voted
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Let G be an embedded planar graph whose edges may be curves. The detour between two points, p and q (on edges or vertices) of G, is the ratio between the shortest path in G between...
PODC
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
120
Voted
EMMCVPR
2001
Springer
15 years 6 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...