1986 search results - page 22 / 398 » Path Separability of Graphs |
STOC
2003
ACM
14 years 9 months ago
2003
ACM
STACS
1994
Springer
14 years 22 days ago
1994
Springer
The complexity of the simple maxcut problem is investigated for several special classes of graphs. It is shown that this problem is NP-complete when restricted to one of the follo...
ALGORITHMICA
2010
13 years 8 months ago
2010
Abstract We consider a variant of the path cover problem, namely, the k-fixedendpoint path cover problem, or kPC for short, on interval graphs. Given a graph G and a subset T of k ...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
We present a method for reducing the treewidth of a graph while preserving all the minimal s−t separators. This technique turns out to be very useful in the design of parameteriz...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
For an acyclic directed graph with multiple sources and multiple sinks, we prove that one can choose the Menger's paths between the sources and the sinks such that the number...