41 search results - page 1 / 9 » The Parameterized Complexity of the Induced Matching Problem... |
FAW
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
IPL
2007
13 years 5 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...
JDA
2010
13 years 1 days 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...
ICALP
2001
Springer
13 years 9 months ago
2001
Springer
