Linear ordering based MIP formulations for the vertex separation or pathwidth problem (Q5915912): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2018.11.012
@@ Property / DOI: 10.1016/j.jda.2018.11.012 / rank @@
-Normal rank
@@ Property / describes a project that uses @@
+Harwell-Boeing sparse matrix collection
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2018.11.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2901919692
@@ Property / OpenAlex ID: W2901919692 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+Using ILP/SAT to Determine Pathwidth, Visibility Representations, and other Grid-Based Graph Drawings
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4291429
@@ Property / cites work: Q4291429 / rank @@
+Normal rank
@@ Property / cites work @@
+A partial k-arboretum of graphs with bounded treewidth
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
+Normal rank
@@ Property / cites work @@
+Q4250226
@@ Property / cites work: Q4250226 / rank @@
+Normal rank
@@ Property / cites work @@
+Contraction and Treewidth Lower Bounds
@@ Property / cites work: Contraction and Treewidth Lower Bounds / rank @@
+Normal rank
@@ Property / cites work @@
+A note on exact algorithms for vertex ordering problems on graphs
+Normal rank
@@ Property / cites work @@
+Experimental Evaluation of a Branch-and-Bound Algorithm for Computing Pathwidth and Directed Pathwidth
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search for the vertex separation problem
+Normal rank
@@ Property / cites work @@
+Sparse matrix test problems
@@ Property / cites work: Sparse matrix test problems / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation and search number of a graph
+Normal rank
@@ Property / cites work @@
+Faster Computation of Path-Width
@@ Property / cites work: Faster Computation of Path-Width / rank @@
+Normal rank
@@ Property / cites work @@
+The vertex separation number of a graph equals its path-width
+Normal rank
@@ Property / cites work @@
+Computing Directed Pathwidth in O(1.89 n ) Time
@@ Property / cites work: Computing Directed Pathwidth in O(1.89 n ) Time / rank @@
+Normal rank
@@ Property / cites work @@
+Black-white pebbles and graph separation
@@ Property / cites work: Black-white pebbles and graph separation / rank @@
+Normal rank
@@ Property / cites work @@
+Linear ordering based MIP formulations for the vertex separation or pathwidth problem
+Normal rank
@@ Property / cites work @@
+The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for the matrix bandwidth minimization
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Computing Pathwidth Faster Than 2 n
@@ Property / cites work: Computing Pathwidth Faster Than 2 n / rank @@
+Normal rank
@@ Property / cites work @@
+Digraph searching, directed vertex separation and directed pathwidth
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2018.11.012
@@ Property / DOI: 10.1016/J.JDA.2018.11.012 / rank @@
+Normal rank