Generating Minimal k-Vertex Connected Spanning Subgraphs
From MaRDI portal
Publication:3608847
Cited in
(6)- Solving the degree-concentrated fault-tolerant spanning subgraph problem by DC programming
- Generating 3-vertex connected spanning subgraphs
- Enumeration of support-closed subsets in confluent systems
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Scientific contributions of Leo Khachiyan (a short overview)
This page was built for publication: Generating Minimal k-Vertex Connected Spanning Subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608847)