Maximum packing for $k$-connected partial $k$-trees in polynomial time (Q1978642): Difference between revisions

@@ Property / cites work @@
+Easy problems for tree-decomposable graphs
@@ Property / cites work: Easy problems for tree-decomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Memory requirements for table computations in partial \(k\)-tree algorithms
+Normal rank
@@ Property / cites work @@
+Generalized planar matching
@@ Property / cites work: Generalized planar matching / rank @@
+Normal rank
@@ Property / cites work @@
+Q3795218
@@ Property / cites work: Q3795218 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+Faster algorithms for subgraph isomorphism of κ-connected partial κ-trees
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of subgraph isomorphism for classes of partial k-trees
+Normal rank
@@ Property / cites work @@
+Characterizing the complexity of subgraph isomorphism for graphs of bounded path-width
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+On generalized matching problems
@@ Property / cites work: On generalized matching problems / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+Maximum packing for biconnected outerplanar graphs
+Normal rank
@@ Property / cites work @@
+Q4385515
@@ Property / cites work: Q4385515 / rank @@
+Normal rank
@@ Property / cites work @@
+Subgraph isomorphism for biconnected outerplanar graphs in cubic time
+Normal rank
@@ Property / cites work @@
+Subtree isomorphism is NC reducible to bipartite perfect matching
+Normal rank
@@ Property / cites work @@
+Q3804190
@@ Property / cites work: Q3804190 / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum tree-packing in time \(O(n^{5/2})\)
@@ Property / cites work: Maximum tree-packing in time \(O(n^{5/2})\) / rank @@
+Normal rank
@@ Property / cites work @@
+Subtree Isomorphism in O(n5/2)
@@ Property / cites work: Subtree Isomorphism in O(n5/2) / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of finding iso- and other morphisms for partial \(k\)- trees
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+On simple characterizations of k-trees
@@ Property / cites work: On simple characterizations of k-trees / rank @@
+Normal rank

Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time (Q1978642): Difference between revisions

Latest revision as of 16:32, 29 May 2024

Statements

Sitelinks

Mathematics(1 entry)