A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (Q5248999): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On independent spanning trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A linear-time algorithm for four-partitioning four-connected planar graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Three tree-paths / rank | |||
Normal rank | |||
Latest revision as of 01:16, 10 July 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
0 references
