Linear layouts in submodular systems
From MaRDI portal
Publication:4909564
DOI10.1007/978-3-642-35261-4_50zbMATH Open1260.90160OpenAlexW75009678MaRDI QIDQ4909564FDOQ4909564
Authors: Hiroshi Nagamochi 
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
Recommendations
- scientific article; zbMATH DE number 1670677
- Mathematical Foundations of Computer Science 2003
- Derivation of algorithms for cutwidth and related graph layout parameters
- Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
- Planar linear arrangements of outerplanar graphs
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62)
Cited In (13)
- Linear layout of directed grid graph
- Obstructions for matroids of path-width at most \(k\) and graphs of linear rank-width at most \(k\)
- A simpler self-reduction algorithm for matroid path-width
- Mathematical Foundations of Computer Science 2003
- Computing directed pathwidth in \(O(1.89^n)\) time
- Characterizations and directed path-width of sequence digraphs
- On the pathwidth of almost semicomplete digraphs
- Comparing linear width parameters for directed graphs
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- Computing the pathwidth of directed graphs with small vertex cover
- Rank-width: algorithmic and structural results
- Derivation of algorithms for cutwidth and related graph layout parameters
- How to compute digraph width measures on directed co-graphs
This page was built for publication: Linear layouts in submodular systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909564)
