1736 search results - page 38 / 348 » The rank-width of Directed Graphs |
TCS
2008
14 years 10 months ago
2008
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolu...
JACM
2007
14 years 10 months ago
2007
ALGORITHMICA
2000
14 years 10 months ago
2000
DAGSTUHL
2007
14 years 11 months ago
2007
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open problem. In this paper, we prove that the paramet...
FOCS
1999
IEEE
15 years 2 months ago
1999
IEEE
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...