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

Author： M. Nivat   Jamison B.   Olariu S.  

Publisher： Elsevier

ISSN： 0304-3975

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

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

Abstract

Related content

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

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

On extended P 4 -reducible and extended P 4 -sparse graphs

By Giakoumakis V.   Vanherpe J.-M.  

Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. : 269-286

Elsevier

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

A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem

By Bonizzoni Paola  

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 267-285

Springer Publishing Company

Access to resources Recommend Favorite