Maximum tree-packing in time \(O(n^{5/2})\)
From MaRDI portal
Publication:1391314
DOI10.1016/S0304-3975(96)00276-9zbMath0901.68150MaRDI QIDQ1391314
Publication date: 22 July 1998
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (2)
Maximum packing for biconnected outerplanar graphs ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
Cites Work
- Unnamed Item
- Packings by cliques and by finite families of graphs
- Subtree isomorphism is NC reducible to bipartite perfect matching
- On generalized matching problems
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Parallel concepts in graph theory
- On the computational power of pushdown automata
- On the Complexity of General Graph Factor Problems
- Generalized planar matching
- Packings by Complete Bipartite Graphs
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected
- An Analysis of a Good Algorithm for the Subtree Problem
- Subtree Isomorphism in O(n5/2)
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- On the completeness of a generalized matching problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: Maximum tree-packing in time \(O(n^{5/2})\)
