Computing Tree-Depth Faster Than 2 n

DOI10.1007/978-3-319-03898-8_13zbMATH Open1406.68039OpenAlexW2060423839WikidataQ60488415 ScholiaQ60488415MaRDI QIDQ2867079FDOQ2867079

Authors: Fedor V. Fomin, Archontia C. Giannopoulou, Michał Pilipczuk 

Publication date: 10 December 2013

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_13

Recommendations

• Computing tree-depth faster than \(2^n\)
• A faster parameterized algorithm for treedepth
• On the complexity of computing treelength
• On the Complexity of Computing Treelength
• On the complexity of computing treebreadth
• On the complexity of computing treebreadth
• Bounding the depth of search trees
• On the recursion depth of special tree traversal algorithms
• Tree enumeration and tree algorithm complexity computation
• scientific article; zbMATH DE number 3954287

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Connectivity (05C40)

Cited In (5)

• Computing Pathwidth Faster Than 2 n
• On vertex rankings of graphs and its relatives
• A faster parameterized algorithm for treedepth
• Title not available (Why is that?)
• Computing directed pathwidth in \(O(1.89^n)\) time

This page was built for publication: Computing Tree-Depth Faster Than 2 n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2867079)