k-Outerplanar Graphs, Planar Duality, and Low Stretch Spanning Trees

ISSN： 0178-4617

Source： Algorithmica, Vol.61, Iss.1, 2011-09, pp. : 141-160

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Embedding k(n-k) edge-disjoint spanning trees in arrangement graphs

By Lin C.-T.

Journal of Parallel and Distributed Computing, Vol. 63, Iss. 12, 2003-12 ,pp. : 1277-1287

Elsevier

Access to resources Recommend Favorite

Optimal Independent Spanning Trees on Odd Graphs

By Kim Jong-Seok Lee Hyeong-Ok Cheng Eddie Lipták László

The Journal of Supercomputing, Vol. 56, Iss. 2, 2011-05 ,pp. : 212-225

Springer Publishing Company

Access to resources Recommend Favorite

How to Use Spanning Trees to Navigate in Graphs

By Dragan Feodor Xiang Yang

Algorithmica, Vol. 66, Iss. 3, 2013-07 ,pp. : 479-511

Springer Publishing Company

Access to resources Recommend Favorite

Non-uniform random spanning trees on weighted graphs

By Mosbah M. Saheb N.

Theoretical Computer Science, Vol. 218, Iss. 2, 1999-05 ,pp. : 263-271

Elsevier

Access to resources Recommend Favorite

Linear-time algorithms for parametric minimum spanning tree problems on planar graphs

By Fernandez-Baca D. Slutzki G.

Theoretical Computer Science, Vol. 181, Iss. 1, 1997-07 ,pp. : 57-74

Elsevier

Access to resources Recommend Favorite