Computing directed pathwidth in \(O(1.89^n)\) time
From MaRDI portal
Publication:300464
DOI10.1007/s00453-015-0015-9zbMath1339.05392MaRDI QIDQ300464
Yasuaki Kobayashi, Hisao Tamaki, Kenta Kitsunai, Keita Komuro, Toshihiro Tano
Publication date: 28 June 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-0015-9
68Q25: Analysis of algorithms and problem complexity
05C12: Distance in graphs
05C85: Graph algorithms (graph-theoretic aspects)