Two linear time algorithms for MST on minor closed graph classes. (Q3435477)
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: Two linear time algorithms for MST on minor closed graph classes. |
scientific article; zbMATH DE number 5146643
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two linear time algorithms for MST on minor closed graph classes. |
scientific article; zbMATH DE number 5146643 |
Statements
26 April 2007
0 references
minimum spanning tree
0 references
deterministic algorithms
0 references
0.8532910943031311
0 references
0.8433734774589539
0 references
0.8391849994659424
0 references
0.8310844302177429
0 references
0.8265274167060852
0 references
