Skip to content

Known Algorithms on Graphs on Bounded Treewidth are Probably Optimal.

Daniel Lokshtanov, Dniel Marx, Saket Saurabh

VenueA*SODA
Year2011
ProceedingsSODA

Browse the full SODA paper archive.