Results 1  10
of
432
Graph Symmetry Detection and Canonical Labeling: Differences and Synergies
"... Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects facilitates easy equivalence checking through quick matching. All exi ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Symmetries of combinatorial objects are known to complicate search algorithms, but such obstacles can often be removed by detecting symmetries early and discarding symmetric subproblems. Canonical labeling of combinatorial objects facilitates easy equivalence checking through quick matching. All
Search space contraction in canonical labeling of graphs
 CORR
, 2008
"... The individualizationrefinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated. New techniques are introduced with the aim of reducing the size of the associated search space. In particular, a new partition refinement algorithm is proposed, toge ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
The individualizationrefinement paradigm for computing a canonical labeling and/or the automorphism group of a graph is investigated. New techniques are introduced with the aim of reducing the size of the associated search space. In particular, a new partition refinement algorithm is proposed
Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
"... The problem of canonically labeling a graph is studied. Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed. Experiments indicate ..."
Abstract

Cited by 43 (1 self)
 Add to MetaCart
The problem of canonically labeling a graph is studied. Within the general framework of backtracking algorithms based on individualization and refinement, data structures, subroutines, and pruning heuristics especially for fast handling of large and sparse graphs are developed. Experiments indicate
Conflict propagation and component recursion for canonical labeling
 In Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems, TAPASâ€™11
, 2011
"... Abstract. The individualize and refine approach for computing automorphism groups and canonical forms of graphs is studied. Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented. Experiment ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. The individualize and refine approach for computing automorphism groups and canonical forms of graphs is studied. Two new search space pruning techniques, conflict propagation based on recorded failure information and recursion over nonuniformly joined components, are presented
gSpan: GraphBased Substructure Pattern Mining
, 2002
"... We investigate new approaches for frequent graphbased pattern mining in graph datasets and propose a novel algorithm called gSpan (graphbased Substructure pattern mining) , which discovers frequent substructures without candidate generation. gSpan builds a new lexicographic order among graphs, and ..."
Abstract

Cited by 650 (34 self)
 Add to MetaCart
, and maps each graph to a unique minimum DFS code as its canonical label. Based on this lexicographic order, gSpan adopts the depthfirst search strategy to mine frequent connected subgraphs efficiently. Our performance study shows that gSpan substantially outperforms previous algorithms, sometimes
The Complexity of McKay's Canonical Labeling Algorithm
, 1996
"... We study the time complexity of McKay's algorithm to compute canonical forms and automorphism groups of graphs. The algorithm is based on a type of backtrack search, and it performs pruning by discovered automorphisms and by hashing partial information of vertex labelings. In practice, the algo ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
We study the time complexity of McKay's algorithm to compute canonical forms and automorphism groups of graphs. The algorithm is based on a type of backtrack search, and it performs pruning by discovered automorphisms and by hashing partial information of vertex labelings. In practice
Isomorphism, automorphism partitioning, and canonical labeling can be solved in polynomialâ€“time for molecular graphs
 JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCE
, 1998
"... The graph isomorphism problem belongs to the class of NP problems, and has been conjectured intractable, although probably not NPcomplete. However, in the context of chemistry, because molecules are a restricted class of graphs, the problem of graph isomorphism can be solved efficiently (i.e., in p ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
.e., in polynomialtime). This paper presents the theoretical results that for all molecules, the problems of isomorphism, automorphism partitioning, and canonical labeling are polynomialtime problems. Simple polynomialtime algorithms are also given for planar molecular graphs and used for automorphism
Frequent Subgraph Discovery
, 2001
"... Over the years, frequent itemset discovery algorithms have been used to solve various interesting problems. As data mining techniques are being increasingly applied to nontraditional domains, existing approaches for finding frequent itemsets cannot be used as they cannot model the requirement of th ..."
Abstract

Cited by 406 (10 self)
 Add to MetaCart
transactions and it is able to discover frequent subgraphs from a set of graph transactions reasonably fast, even though we have to deal with computationally hard problems such as canonical labeling of graphs and subgraph isomorphism which are not necessary for traditional frequent itemset discovery.
Practical Graph Isomorphism
, 1981
"... We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh.ic ..."
Abstract

Cited by 337 (7 self)
 Add to MetaCart
We develop an improved algorithm for canonically labelling a graph and finding generators for its automorph.ism grou.p. The emphasis i, on th.e power of the algorithm for,01 fling pr4ctical problem.t, rather than on the theoretical n,icetiu of tJu algo rith.m. Th.e nsult is a.n implementa.tion wh
On Canonical Numbering of Carbon Atoms in Fullerenes:
, 2005
"... Numbering of atoms in relatively large molecules, such as fullerenes appears for most part to be arbitrary or based on ad hoc schemes. We argue in favor of the use of a particular canonical labeling of atoms in molecules based on the smallest possible binary molecular code obtained from the adjacenc ..."
Abstract
 Add to MetaCart
Numbering of atoms in relatively large molecules, such as fullerenes appears for most part to be arbitrary or based on ad hoc schemes. We argue in favor of the use of a particular canonical labeling of atoms in molecules based on the smallest possible binary molecular code obtained from
Results 1  10
of
432