Maximum packing for biconnected outerplanar graphs
DOI10.1016/S0166-218X(99)00176-6zbMATH Open0944.05075OpenAlexW2105366839MaRDI QIDQ1962022FDOQ1962022
Publication date: 15 September 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00176-6
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Introduction to algorithms
- Easy problems for tree-decomposable graphs
- Title not available (Why is that?)
- On the completeness of a generalized matching problem
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Approximation algorithms for maximum two-dimensional pattern matching
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Title not available (Why is that?)
- On generalized matching problems
- The subgraph isomorphism problem for outerplanar graphs
- Generalized planar matching
- Subtree Isomorphism in O(n5/2)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Title not available (Why is that?)
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Maximum tree-packing in time \(O(n^{5/2})\)
- Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
Cited In (2)
This page was built for publication: Maximum packing for biconnected outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962022)
