Author： Hong Seok-Hee Nagamochi Hiroshi
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.58, Iss.2, 2010-10, pp. : 433-460
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Access to resources
Recommend
Convex Drawings of 3-Connected Plane Graphs
By Bonichon Nicolas Felsner Stefan Mosbah Mohamed
Algorithmica, Vol. 47, Iss. 4, 2007-05 ,pp. :
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. :
A Cutting Plane Algorithm for Linear Reverse Convex Programs
Annals of Operations Research, Vol. 105, Iss. 1-4, 2001-07 ,pp. :
A Linear-Time Algorithm for the Perfect Phylogeny Haplotype Problem
Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. :