1986 search results - page 85 / 398 » Path Separability of Graphs |
120
click to vote
JCO
2007
15 years 2 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...
123
click to vote
JDA
2010
14 years 9 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
139
click to vote
CIKM
1994
Springer
15 years 6 months ago
1994
Springer
This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects ...
114
click to vote
COMPGEOM
2004
ACM
15 years 7 months ago
2004
ACM
The Reeb graph is a useful tool in visualizing real-valued data obtained from computational simulations of physical processes. We characterize the evolution of the Reeb graph of a...
100
Voted
WG
2001
Springer
15 years 6 months ago
2001
Springer
There exists a polynomial time algorithm to compute the pathwidth of outerplanar graphs [3], but the large exponent makes this algorithm impractical. In this paper, we give an alg...