New Linear-Time Algorithms for Edge-Coloring Planar Graphs

ISSN： 0178-4617

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

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

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

Parallel Algorithms for the Edge-Coloring and Edge-Coloring Update Problems

By Liang W. Shen X. Hu Q.

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 1, 1996-01 ,pp. : 66-73

Academic Press

Access to resources Recommend Favorite

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

By Hong Seok-Hee Nagamochi Hiroshi

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

Springer Publishing Company

Access to resources Recommend Favorite

Edge coloring of bipartite graphs with constraints

By Caragiannis I. Kaklamanis C. Persiano P.

Theoretical Computer Science, Vol. 270, Iss. 1, 2002-01 ,pp. : 361-399

Elsevier

Access to resources Recommend Favorite

Linear-Time Recognition of Helly Circular-Arc Models and Graphs

By Joeris Benson Lin Min McConnell Ross Spinrad Jeremy Szwarcfiter Jayme

Algorithmica, Vol. 59, Iss. 2, 2011-02 ,pp. : 215-239

Springer Publishing Company

Access to resources Recommend Favorite