Finding Four Independent Trees | Zendy

Sean Curran | Zendy; Orlando Lee | Zendy; Xingxing Yu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Finding Four Independent Trees

Author(s) -

Sean Curran,

Orlando Lee,

Xingxing Yu

Publication year - 2006

Publication title -

siam journal on computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.533

H-Index - 122

eISSN - 1095-7111

pISSN - 0097-5397

DOI - 10.1137/s0097539703436734

Subject(s) - spanning tree , combinatorics , trémaux tree , minimum spanning tree , connected dominating set , mathematics , graph , connectivity , minimum degree spanning tree , kruskal's algorithm , discrete mathematics , computer science , line graph , pathwidth

Motivated by a multitree approach to the design of reliable communication protocols, Itai and Rodeh gave a linear time algorithm for finding two independent spanning trees in a 2-connected graph. Cheriyan and Maheshwari gave an O(vertical bar V vertical bar(2)) algorithm for finding three independent spanning trees in a 3-connected graph. In this paper we present an O(vertical bar V vertical bar(3)) algorithm for finding four independent spanning trees in a 4-connected graph. We make use of chain decompositions of 4-connected graphs

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research