English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl       
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

https://drops.dagstuhl.de/opus/volltexte/2021/14109/pdf/LIPIcs-ICALP-2021-40.pdf
(Publisher version)

https://creativecommons.org/licenses/by/4.0/legalcode
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., & Slusallek, J. (2021). Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. In N. Bansal, E. Merelli, & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (pp. 1-16). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.ICALP.2021.40.


Cite as: https://hdl.handle.net/21.11116/0000-0008-DB85-B
Abstract
There is no abstract available