Computing Minimal Spanning Subgraphs in Linear Time (Q4862800)
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: Publication:4862800 |
scientific article; zbMATH DE number 840260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing Minimal Spanning Subgraphs in Linear Time |
scientific article; zbMATH DE number 840260 |
Statements
Computing Minimal Spanning Subgraphs in Linear Time (English)
0 references
14 July 1996
0 references
monotone property
0 references
\(P\)-graph
0 references
digraphs
0 references
2-edge-connectivity
0 references
spanning trees
0 references
complexity
0 references
parallel algorithms
0 references
worst-case complexity
0 references
strongly connected spanning subgraph
0 references
linear algorithm
0 references
collapsing cycles
0 references
contracting chains
0 references
0.9401037693023682
0 references
0.8700198531150818
0 references
0.8657808899879456
0 references
0.8005359172821045
0 references
