1542 search results - page 198 / 309 » Kernelization of packing problems |
136
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
126
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
We present the first thorough theoretical analysis of the Transitivity Editing problem on digraphs. Herein, the task is to perform a minimum number of arc insertions or deletions ...
128
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
135
click to vote
NETWORKS
2010
15 years 9 days ago
2010
We provide first-time fixed-parameter tractability results for the NP-complete problems Maximum Full-Degree Spanning Tree and Minimum-Vertex Feedback Edge Set. These problems are...
139
click to vote
DIS
2007
Springer
15 years 8 months ago
2007
Springer
We describe a technique for comparing distributions without the need for density estimation as an intermediate step. Our approach relies on mapping the distributions into a reprodu...