Sciweavers

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

66

Voted

IPL
2008

58views more IPL 2008»

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees

15 years 2 months ago

Two fixed-parameter algorithms for Vertex Covering by Paths on Trees

Download theinf1.informatik.uni-jena.de

Jiong Guo, Rolf Niedermeier, Johannes Uhlmann

Real-time Traffic

IPL 2008 |

claim paper

Related Content

» Covering a Tree by a Forest

» Querying Graphs in ProteinProtein Interactions Networks Using Feedback Vertex Set

» Tree Embeddings for TwoEdgeConnected Network Design

» Frugality ratios and improved truthful mechanisms for vertex cover

» Covering minimum spanning trees of random subgraphs

» Approximability of Combinatorial Problems with Multiagent Submodular Cost Functions

» How to Pay Come What May Approximation Algorithms for DemandRobust Covering Problems

» Improved Shortest Path Algorithms For Nearly Acyclic Directed Graphs

» NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Pa...

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Jiong Guo, Rolf Niedermeier, Johannes Uhlmann

Comments (0)