On the two-connected planar spanning subgraph polytope
From MaRDI portal
(Redirected from Publication:1382280)
The authors investigate the problem of finding a two-connected spanning planar subgraph of maximum weight in a complete edge-weighted graph, from a polyhedral point of view. The problem is important in automatic graph drawing.
Recommendations
Cites work
- `` Strong NP-Completeness Results
- A polyhedral approach to planar augmentation and related problems
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
Cited in
(9)- Two-edge connected spanning subgraphs and polyhedra
- 2-connected spanning subgraphs of planar 3-connected graphs
- On finding two-connected subgraphs in planar graphs
- Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs
- Spanning planar subgraphs of graphs in the torus and Klein bottle
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Minimum face-spanning subgraphs of plane graphs
- scientific article; zbMATH DE number 2226729 (Why is no real title available?)
- On the dominant of the Steiner 2-edge connected subgraph polytope
This page was built for publication: On the two-connected planar spanning subgraph polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382280)
