1986 search results - page 3 / 398 » Path Separability of Graphs |
WADS
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
CEC
2005
IEEE
13 years 8 months ago
2005
IEEE
In this paper, a demonstration of DNA computing for k-shortest paths of a weighted graph is realized by biochemical experiments in such a way that every path is encoded by oligonuc...
WG
2010
Springer
13 years 4 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
SODA
2003
ACM
13 years 7 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
TVCG
2011
13 years 1 months ago
2011
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...