Sciweavers

Share
12 search results - page 1 / 3
» Parameterized Complexity of Finding Subgraphs with Hereditar...
Sort
View
COCOON
2000
Springer
11 years 9 months ago
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
Subhash Khot, Venkatesh Raman
IPL
2007
121views more  IPL 2007»
11 years 5 months ago
Parameterized complexity of the induced subgraph problem in directed graphs
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...
Venkatesh Raman, Somnath Sikdar
ACID
2006
237views Algorithms» more  ACID 2006»
11 years 6 months ago
Parameterized Complexity of Finding Regular Induced Subgraphs
The r-Regular Induced Subgraph problem asks, given a graph G and a nonnegative integer k, whether G contains an r-regular induced subgraph of size at least k, that is, an induced ...
Hannes Moser, Dimitrios M. Thilikos
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
11 years 11 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ACID
2006
220views Algorithms» more  ACID 2006»
11 years 6 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
books