Maximum packing for k-connected partial k-trees in polynomial time
From MaRDI portal
Publication:1978642
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
- scientific article; zbMATH DE number 4060712 (Why is no real title available?)
- scientific article; zbMATH DE number 4072379 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1142299 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
- Easy problems for tree-decomposable graphs
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
- Generalized planar matching
- Graph minors. II. Algorithmic aspects of tree-width
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Maximum packing for biconnected outerplanar graphs
- Maximum tree-packing in time \(O(n^{5/2})\)
- Memory requirements for table computations in partial \(k\)-tree algorithms
- On generalized matching problems
- On simple characterizations of k-trees
- On the completeness of a generalized matching problem
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Parallel concepts in graph theory
- Subgraph isomorphism for biconnected outerplanar graphs in cubic time
- Subtree Isomorphism in O(n5/2)
- Subtree isomorphism is NC reducible to bipartite perfect matching
- The complexity of subgraph isomorphism for classes of partial k-trees
Cited in
(5)- Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
- Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees
- Maximum tree-packing in time O(n5/2)
- On the complexity of finding iso- and other morphisms for partial \(k\)- trees
- Maximum packing for biconnected outerplanar graphs
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)
