332 search results - page 2 / 67 » Parameterized Graph Separation Problems |
COCOON
2001
Springer
15 years 2 months ago
2001
Springer
113
click to vote
SODA
2010
ACM
15 years 6 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
87
Voted
IPL
2007
14 years 9 months ago
2007
In this paper, we consider the parameterized complexity of the following problem: Given a hereditary property P on digraphs, an input digraph D and a positive integer k, does D ha...
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...
IWOCA
2010
Springer
14 years 4 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...