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

DOI10.1007/3-540-40064-8_27MaRDI QIDQ2766691zbMATH OpenFDO

Authors Sayaka Nagai, Shin-Ichi Nakano

Publication date 14 July 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40064-8_27

zbMATH Keywords

independent spanning treeslinear-time algorithmmaximal planar graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• A linear-time algorithm to find four independent spanning trees in four-connected planar graphs
• Finding independent spanning trees in partial k-trees
• Completely independent spanning trees in maximal planar graphs
• Finding Four Independent Trees

Cited in

(13)

• Edge-orders
• A linear time algorithm for finding depth-first spanning trees on trapezoid graphs
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• A linear-time algorithm to find four independent spanning trees in four-connected planar graphs
• scientific article; zbMATH DE number 475595 (Why is no real title available?)
• Completely independent spanning trees in maximal planar graphs
• Finding independent spanning trees in partial k-trees
• A linear-time algorithm to find four independent spanning trees in four connected planar graphs
• Constructing independent spanning trees for locally twisted cubes
• Independent spanning trees on even networks
• Finding Four Independent Trees
• \((t, s)\)-completely independent spanning trees
• A Schnyder-type drawing algorithm for 5-connected triangulations

This page was built for publication: A linear-time algorithm to find independent spanning trees in maximal planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2766691)