Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

90

WG
1994
Springer

favoriteEmaildiscussreport

131views Theoretical Computer Science» more WG 1994»

Complexity of Graph Covering Problems

15 years 1 months ago

Complexity of Graph Covering Problems

Download reference.kfupm.edu.sa

Jan Kratochvíl, Andrzej Proskurowski, Jan A

Real-time Traffic

Theoretical Computer Science | WG 1994 |

claim paper

Related Content

» Complexity and Approximation Results for the Connected Vertex Cover Problem

» On the Algorithmic Complexity of Twelve Covering and Independence Parameters of Graphs

» Distributed and parallel algorithms for weighted vertex cover and other covering problems

» The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

» Pareto Complexity of TwoParameter FPT Problems A Case Study for Partial Vertex Cover

» Vertex and Edge Covers with Clustering Properties Complexity and Algorithms

» On the computational complexity of partial covers of Theta graphs

» Subexponential Algorithms for Partial Cover Problems

» A polynomial solution to the kfixedendpoint path cover problem on proper interval graphs

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	WG
Authors	Jan Kratochvíl, Andrzej Proskurowski, Jan Arne Telle

Comments (0)