A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners

ISSN： 0178-4617

Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 1122-1158

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

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

By Hong Seok-Hee Nagamochi Hiroshi

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 433-460

Springer Publishing Company

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

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

By Cole Richard Kowalik Łukasz

Algorithmica, Vol. 50, Iss. 3, 2008-03 ,pp. : 351-368

Springer Publishing Company

Access to resources Recommend Favorite

A linear-time recognition algorithm for P 4 -reducible graphs

By M. Nivat Jamison B. Olariu S.

Theoretical Computer Science, Vol. 145, Iss. 1, 1995-07 ,pp. : 329-344

Elsevier

Access to resources Recommend Favorite

A linear-time optimal-message distributed algorithm for minimum spanning trees

By Faloutsos Michalis Molle Mart

Distributed Computing, Vol. 17, Iss. 2, 2004-08 ,pp. : 151-170

Springer Publishing Company

Access to resources Recommend Favorite