Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
10
click to vote
IPL
2008
favorite
Email
discuss
report
58
views
more
IPL 2008
»
Two fixed-parameter algorithms for Vertex Covering by Paths on Trees
13 years 7 months ago
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...
more »
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)
Researcher Info
IPL 2008 Study Group
Computer Vision