1736 search results - page 38 / 348 » The rank-width of Directed Graphs |
135
Voted
TCS
2008
15 years 3 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...
96
Voted
ALGORITHMICA
2000
15 years 3 months ago
2000
137
Voted
DAGSTUHL
2007
15 years 5 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...
132
Voted
FOCS
1999
IEEE
15 years 8 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...