Author： Bodlaender H.L. Fomin F.V.
Publisher： Academic Press
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.43, Iss.2, 2002-05, pp. : 190-200
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Circumference and Pathwidth of Highly Connected Graphs
JOURNAL OF GRAPH THEORY, Vol. 79, Iss. 3, 2015-07 ,pp. :
Access to resources
Recommend
Maximum Induced Linear Forests in Outerplanar Graphs
Graphs and Combinatorics, Vol. 20, Iss. 1, 2004-03 ,pp. :
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
Journal of Algorithms, Vol. 35, Iss. 2, 2000-05 ,pp. :
By Schietgat Leander Ramon Jan Bruynooghe Maurice
Annals of Mathematics and Artificial Intelligence, Vol. 69, Iss. 4, 2013-12 ,pp. :