Graph canonization

Known as: Graph canonicalization 
In graph theory, a branch of mathematics, graph canonization is the problem finding a canonical form of a given graph G. A canonical form is a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Due to recent advances, constraint solvers have become efficient tools for synthesizing optimum Boolean circuits. We take… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • table III
Is this relevant?
2015
2015
Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it… Expand
Is this relevant?
2013
2013
We study the problem of computing canonical forms for graphs and hypergraphs under Abelian group action and show tight complexity… Expand
Is this relevant?
2012
2012
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2009
2009
  • Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
  • 24th Annual IEEE Conference on Computational…
  • 2009
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2007
Highly Cited
2007
The problem of canonically labeling a graph is studied. Within the general framework of backtracking algorithms based on… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
2003
2003
We consider various classes of graph polynomials and study their computational complexity. Our main focus is on Farrell… Expand
Is this relevant?
1997
1997
Abstract We consider infinitary logic with only two variable symbols, both with and without counting quantifiers, i.e. L 2 ≔ L… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
In this paper we ask the question, “What must be added to first-order logic plus least-fixed point to obtain exactly the… Expand
Is this relevant?