Maximum packing for biconnected outerplanar graphs

Maximum packing for biconnected outerplanar graphs

0.00 Avg rating—0 Votes
Article ID: iaor20013534
Country: Netherlands
Volume: 100
Issue: 1/2
Start Page Number: 85
End Page Number: 94
Publication Date: Mar 2000
Journal: Discrete Applied Mathematics
Authors: ,
Keywords: packing
Abstract:

The problem of determining the maximum number of vertex-disjoint subgraphs of a biconnected outerplanar graph H on nh vertices isomorphic to a ‘pattern’ biconnected outerplanar graph G on ng vertices is shown to be solvable in time O((nhng)2).

Reviews

Required fields are marked *. Your email address will not be published.