Polynomial time algorithms for variants of graph matching on partial $k$-trees (Q1692069): Difference between revisions

@@ Property / cites work @@
+Complexity of Finding Embeddings in a <i>k</i>-Tree
+Normal rank
@@ Property / cites work @@
+The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+On testing isomorphism of permutation graphs
@@ Property / cites work: On testing isomorphism of permutation graphs / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q4273947
@@ Property / cites work: Q4273947 / rank @@
+Normal rank
@@ Property / cites work @@
+Some NP-Complete Problems Similar to Graph Isomorphism
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Deciding Interval Graph Isomorphism
+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 @@
+Computational complexity of computing a partial solution for the graph automorphism problems
+Normal rank
@@ Property / cites work @@
+Laminar structure of ptolemaic graphs with applications
+Normal rank

Polynomial time algorithms for variants of graph matching on partial \(k\)-trees (Q1692069): Difference between revisions