4865 search results - page 66 / 973 » The Complexity of Graph Connectivity |
WG
2004
Springer
14 years 3 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
ALGORITHMICA
2006
13 years 10 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
VDA
2010
14 years 20 days ago
2010
While there have been intensive efforts in developing better 3D flow visualization techniques, little attention has been paid to the design of better user interfaces and more effe...
SIGAL
1990
14 years 2 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
IFIPTCS
2010
13 years 8 months ago
2010
Most highly dynamic infrastructure-less networks have in common that the assumption of connectivity does not necessarily hold at a given instant. Still, communication routes can be...