Maximum tree-packing in time O(n5/2)

DOI10.1007/bfb0030826zbMath1527.68165OpenAlexW1539573244MaRDI QIDQ6085700

Andrzej Lingas

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030826

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• 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
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum tree-packing in time O(n5/2)