Results 241 to 250 of about 17,985 (261)

Exploring the gap between treedepth and vertex cover through vertex integrity

Theoretical Computer Science, 2022
Tesshu Hanaka, Yota Otachi, Masashi Kiyomi   +2 more
exaly  

Minimum k-path vertex cover

Discrete Applied Mathematics, 2011
Boštjan Brešar, Gabriel Semanišin, Jan Katrenič   +2 more
exaly  

Parameterized Complexity of Vertex Cover Variants

Theory of Computing Systems, 2007
Rolf Niedermeier, Jiong Guo, Sebastian Wernicke   +2 more
exaly  

On computing the minimum 3-path vertex cover and dissociation number of graphs

Theoretical Computer Science, 2011
Ingo Schiermeyer, Jan Katrenič
exaly  

A fixed-parameter algorithm for the vertex cover P3 problem

Information Processing Letters, 2015
Jianhua Tu
exaly  

On the vertex k-path cover

Discrete Applied Mathematics, 2013
Boštjan Brešar, Andrej Taranenko, Marko Jakovac   +2 more
exaly  

Kernelization of the 3-path vertex cover problem

Discrete Mathematics, 2016
Ingo Schiermeyer, Christoph Brause
exaly  

A faster FPT algorithm for 3-path vertex cover

Information Processing Letters, 2016
Jan Katrenič
exaly  

Parameterized complexity of coloring problems: Treewidth versus vertex cover

Theoretical Computer Science, 2011
Petr Golovach, Jan Kratochvil, Jiří Fiala   +2 more
exaly  

Parameterized algorithm for 3-path vertex cover

Theoretical Computer Science, 2019
Dekel Tsur
exaly