Linear Layouts in Submodular Systems
From MaRDI portal
Publication:4909564
DOI10.1007/978-3-642-35261-4_50zbMath1260.90160OpenAlexW75009678MaRDI QIDQ4909564
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_50
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (10)
Computing directed pathwidth in \(O(1.89^n)\) time ⋮ On the Pathwidth of Almost Semicomplete Digraphs ⋮ A Simpler Self-reduction Algorithm for Matroid Path-Width ⋮ Rank-width: algorithmic and structural results ⋮ Characterizations and directed path-width of sequence digraphs ⋮ Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\) ⋮ How to compute digraph width measures on directed co-graphs ⋮ Computing the pathwidth of directed graphs with small vertex cover ⋮ Comparing linear width parameters for directed graphs ⋮ Myhill-Nerode Methods for Hypergraphs
This page was built for publication: Linear Layouts in Submodular Systems
