Pages that link to "Item:Q998366"
From MaRDI portal
The following pages link to Generating 3-vertex connected spanning subgraphs (Q998366):
Displaying 6 items.
- A new algorithm for generating biconnected spanning subgraphs for topological optimization of data networks (Q1289166) (← links)
- More routes for evacuation (Q1790955) (← links)
- On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs (Q2929622) (← links)
- Spanning even subgraphs of 3‐edge‐connected graphs (Q3652540) (← links)
- A Polynomial Delay Algorithm for Generating Connected Induced Subgraphs of a Given Cardinality (Q5250133) (← links)
- ENUMERATING SPANNING AND CONNECTED SUBSETS IN GRAPHS AND MATROIDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan) (Q5385037) (← links)