Skip to main content
Conference ProceedingsOPEN ACCESS

Maximum packing for biconnected outerplanar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1997) 1214 393-404
DOI: 10.1007/bfb0030613
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

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 0((nh.ng)2).

Cite

CITATION STYLE

APA

Kovacs, T., & Lingas, A. (1997). Maximum packing for biconnected outerplanar graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1214, pp. 393–404). Springer Verlag. https://doi.org/10.1007/bfb0030613

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free