Isomorphism testing via polynomial-time graph extensions (Q662128): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10852-010-9145-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2112057581
@@ Property / OpenAlex ID: W2112057581 / rank @@
+Normal rank
@@ Property / cites work @@
+Random Graph Isomorphism
@@ Property / cites work: Random Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Inexact graph matching by means of estimation of distribution algorithms
+Normal rank
@@ Property / cites work @@
+Isomorphism Testing for Graphs, Semigroups, and Finite Automata are Polynomially Equivalent Problems
+Normal rank
@@ Property / cites work @@
+Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Database of Graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for Graph Isomorphism
@@ Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+A large database of graphs and its use for benchmarking graph isomorphism algorithms
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
+Normal rank
@@ Property / cites work @@
+A molecular structure matching problem
@@ Property / cites work: A molecular structure matching problem / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the derivation of maximal common subgraphs of two directed or undirected graphs
+Normal rank
@@ Property / cites work @@
+Isomorphism of graphs of bounded valence can be tested in polynomial time
+Normal rank
@@ Property / cites work @@
+Q3671211
@@ Property / cites work: Q3671211 / rank @@
+Normal rank
@@ Property / cites work @@
+Evolutionary Computation in Combinatorial Optimization
+Normal rank
@@ Property / cites work @@
+A distance measure between attributed relational graphs for pattern recognition
+Normal rank
@@ Property / cites work @@
+A Fast Backtracking Algorithm to Test Directed Graphs for Isomorphism Using Distance Matrices
+Normal rank
@@ Property / cites work @@
+An Algorithm for Subgraph Isomorphism
@@ Property / cites work: An Algorithm for Subgraph Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Graph isomorphism problem
@@ Property / cites work: Graph isomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the editing distance between unordered labeled trees
+Normal rank