On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs (Q2929622)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs |
scientific article; zbMATH DE number 6369406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs |
scientific article; zbMATH DE number 6369406 |
Statements
14 November 2014
0 references
graph algorithms
0 references
three-edge-connected graph
0 references
three-vertex-connected graph
0 references
cut pair
0 references
depth-first search
0 references
sparse spanning subgraph
0 references
0 references
On finding sparse three-edge-connected and three-vertex-connected spanning subgraphs (English)
0 references
0.8158504962921143
0 references
0.8154076933860779
0 references
0.8079208731651306
0 references
0.7914147973060608
0 references
0.7814407348632812
0 references
