A linear-time algorithm to find independent spanning trees in maximal planar graphs

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E84-A, Issue 5, 2001, Pages 1102-1109

  Nagai, S ^a   Nakano, S I ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Algorithm; Graph; Independent spanning trees

Indexed keywords

ALGORITHMS; GRAPH THEORY;

MAXIAML PLANAR GRAPHS;

TREES (MATHEMATICS);

EID: 0035339293     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (21)