1986 search results - page 14 / 398 » Path Separability of Graphs |
104
click to vote
SIGAL
1990
15 years 3 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial em...
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following well-known problem, which is called the edge-disjoint paths problem. Input: A graph G with n vertices and m edges, k pairs of vertices (s1, t1), (s2, t2)...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
It is proven that the connected pathwidth of any graph G is at most 2