2294 search results - page 71 / 459 » From Path Graphs to Directed Path Graphs |
DM
2006
14 years 12 months ago
2006
Let G be a connected, locally connected, claw-free graph of order n and x, y be two vertices of G. In this paper, we prove that if for any 2-cut S of G, S {x, y} = , then each (x...
ORL
2007
14 years 11 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...
112
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
130
click to vote
FOCS
1995
IEEE
15 years 3 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...
137
click to vote
SMC
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...