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
5
click to vote
CORR
2010
Springer
favorite
Email
discuss
report
55
views
Education
»
more
CORR 2010
»
Known Algorithms on Graphs of Bounded Treewidth are Probably Optimal
13 years 5 months ago
Download
www.cs.bme.hu
Daniel Lokshtanov, Dániel Marx, Saket Saura
Real-time Traffic
CORR 2010
|
Education
|
claim paper
Related Content
»
Equivalence of local treewidth and linear local treewidth and its algorithmic applications
»
CliqueWidth and Parity Games
»
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs
»
Parallel Algorithms with Optimal Speedup for Bounded Treewidth
»
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
»
An exact almost optimal algorithm for target set selection in social networks
»
Optimal Parametric Search on Graphs of Bounded TreeWidth
»
Computing the Tutte Polynomial on Graphs of Bounded CliqueWidth
»
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth grap...
more »
Post Info
More Details (n/a)
Added
09 Dec 2010
Updated
09 Dec 2010
Type
Journal
Year
2010
Where
CORR
Authors
Daniel Lokshtanov, Dániel Marx, Saket Saurabh
Comments
(0)
Researcher Info
Education Study Group
Computer Vision