Maximum packing for k-connected partial k-trees in polynomial time
From MaRDI portal
Publication:1978642
DOI10.1016/S0304-3975(99)00208-XzbMATH Open0938.68143WikidataQ128024496 ScholiaQ128024496MaRDI QIDQ1978642FDOQ1978642
Andrzej Lingas, Anders Dessmark, Andrzej Proskurowski
Publication date: 4 June 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
- Packing trees into complete \(k\)-partite graph
- Tree packing and approximating \(k\)-cuts
- On packing trees into complete bipartite graphs
- Maximum tree-packing in time \(O(n^{5/2})\)
- Maximum tree-packing in time O(n5/2)
- Optimal packings of bounded degree trees
- Packing trees in complete bipartite graphs
- Packingk-edge trees in graphs of restricted vertex degrees
- scientific article; zbMATH DE number 2217849
- Asymptotically optimal tree-packings in regular graphs
Cites Work
- Title not available (Why is that?)
- Easy problems for tree-decomposable graphs
- On the completeness of a generalized matching problem
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Graph minors. II. Algorithmic aspects of tree-width
- A linear time algorithm for finding tree-decompositions of small treewidth
- Parallel concepts in graph theory
- On simple characterizations of k-trees
- Title not available (Why is that?)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Title not available (Why is that?)
- On generalized matching problems
- Generalized planar matching
- The complexity of subgraph isomorphism for classes of partial k-trees
- Subtree Isomorphism in O(n5/2)
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Title not available (Why is that?)
- Subtree isomorphism is NC reducible to bipartite perfect matching
- Memory requirements for table computations in partial \(k\)-tree algorithms
- Maximum tree-packing in time \(O(n^{5/2})\)
- Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
- Maximum packing for biconnected outerplanar graphs
- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
Cited In (4)
This page was built for publication: Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978642)
