Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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.
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
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
2003
2003
We consider various classes of graph polynomials and study their computational complexity. Our main focus is on Farrell… Expand
2002
2002
We show that graph isomorphism is in the complexity class SPP and hence it is in /spl oplus/P (in fact, it is in Mod/sub k/P for… Expand
1999
1999
This book describes the events leading to Becket's murder in the Cathedral. Becket's canonization. 
1995
1995
Information stored in databases is usually incomplete. Typical sources of partiality are missing information, conflicts that… Expand
  • figure I
  • figure I
1995
1995
  • M. Otto
  • Proceedings of Tenth Annual IEEE Symposium on…
  • 1995
  • Corpus ID: 16597182
We consider infinitary logic with two variable symbols and counting quantifiers, C/sup 2/, and its intersection with PTIME on… Expand
  • figure 1
  • figure 2
  • figure 4
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