1986 search results - page 10 / 398 » Path Separability of Graphs |
CCCG
2006
13 years 9 months ago
2006
We study the graph partitioning problem on ddimensional ball graphs in a geometric way. Let B be a set of balls in d-dimensional Euclidean space with radius ratio and -precision....
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
We introduce the concept of multi-directional width-bounded geometric separator and get improved separator for the grid graph, which improves exact algorithm for the protein foldin...
GG
2004
Springer
14 years 26 days ago
2004
Springer
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
FCT
2007
Springer
14 years 1 months ago
2007
Springer
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...