A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS (Q5248999)

From MaRDI portal
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
    0 references
    0 references
    0 references
    0 references
    29 April 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph algorithm
    0 references
    independent spanning tree
    0 references