A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (Q5248999): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:26, 8 February 2024
scientific article; zbMATH DE number 6432006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS |
scientific article; zbMATH DE number 6432006 |
Statements
A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (English)
0 references
29 April 2015
0 references
graph algorithm
0 references
independent spanning tree
0 references
