ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS (Q2929622): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1142/s012905411450018x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1983758508 / rank | |||
Normal rank |
Latest revision as of 10:12, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS |
scientific article |
Statements
ON FINDING SPARSE THREE-EDGE-CONNECTED AND THREE-VERTEX-CONNECTED SPANNING SUBGRAPHS (English)
0 references
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