Cited in
(21)- Min Cut is NP-complete for edge weighted trees
- Narrowness, pathwidth, and their application in natural language processing
- The vertex separation number of a graph equals its path-width
- Improved self-reduction algorithms for graphs with bounded treewidth
- Helicopter search problems, bandwidth and pathwidth
- Searching and pebbling
- Vertex ordering and partitioning problems for random spatial graphs.
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- On tradeoffs between width- and fill-like graph parameters
- An experimental comparison of variable neighborhood search variants for the minimization of the vertex-cut in layout problems
- Fixed-parameter tractability of treewidth and pathwidth
- Variable neighborhood search for the vertex separation problem
- Topological Bandwidth
- An Application of Generalized Tree Pebbling to Sparse Matrix Factorization
- Graph layout problems
- Linear ordering based MIP formulations for the vertex separation or pathwidth problem
- On integer linear programs for treewidth based on perfect elimination orderings
- Treewidth is NP-complete on cubic graphs
- On integer linear programs for treewidth based on perfect elimination orderings (extended version)
- Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.
- The treewidth of line graphs
This page was built for publication: Black-white pebbles and graph separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1149765)
