Linear ordering based MIP formulations for the vertex separation or pathwidth problem
From MaRDI portal
Publication:5915912
DOI10.1016/j.jda.2018.11.012zbMath1403.05149OpenAlexW2901919692MaRDI QIDQ5915912
Publication date: 18 January 2019
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2018.11.012
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Variable neighborhood search for the vertex separation problem
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
- A note on exact algorithms for vertex ordering problems on graphs
- Digraph searching, directed vertex separation and directed pathwidth
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Black-white pebbles and graph separation
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- The vertex separation and search number of a graph
- A branch and bound algorithm for the matrix bandwidth minimization
- Faster Computation of Path-Width
- Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
- Computing Pathwidth Faster Than 2 n
- Graph minors. II. Algorithmic aspects of tree-width
- Complexity of Finding Embeddings in a k-Tree
- Sparse matrix test problems
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Computing Directed Pathwidth in O(1.89 n ) Time
- Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
- Contraction and Treewidth Lower Bounds
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
