Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Moderately Exponential Bound for Graph Isomorphism
FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
Isomorphism of graphs with bounded eigenvalue multiplicity
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
On the nlog n isomorphism technique (A Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Isomorphism testing for graphs of bounded genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Faster isomorphism testing of strongly regular graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Hypergraph isomorphism and structural equivalence of Boolean functions
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Application-specific instruction generation for configurable processor architectures
FPGA '04 Proceedings of the 2004 ACM/SIGDA 12th international symposium on Field programmable gate arrays
The Complexity of Symmetry-Breaking Formulas
Annals of Mathematics and Artificial Intelligence
Extracting frequent connected subgraphs from large graph sets
Journal of Computer Science and Technology
ACM Transactions on Algorithms (TALG)
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Information and Computation
Enumerating consistent metaquery instantiations
AI Communications
Robust content-based MPEG-4 XMT scene structure authentication and multimedia content location
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
On the impossibility of a quantum sieve algorithm for graph isomorphism
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Improved random graph isomorphism
Journal of Discrete Algorithms
Canonical labeling of regular graphs in linear average time
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Journal of Experimental Algorithmics (JEA)
Fast Algorithm for Graph Isomorphism Testing
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Information and Computation
Complete enumeration of compact structural motifs in proteins
ISB '10 Proceedings of the International Symposium on Biocomputing
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
An efficient algorithm of frequent connected subgraph extraction
PAKDD'03 Proceedings of the 7th Pacific-Asia conference on Advances in knowledge discovery and data mining
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Algorithmic problems for metrics on permutation groups
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Isomorphism and canonization of tournaments and hypertournaments
Journal of Computer and System Sciences
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
From invariants to canonization in parallel
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
Journal of Combinatorial Theory Series A
Complexity classes of equivalence problems revisited
Information and Computation
On the Impossibility of a Quantum Sieve Algorithm for Graph Isomorphism
SIAM Journal on Computing
Fixed-point definability and polynomial time on chordal graphs and line graphs
Fields of logic and computation
Conflict propagation and component recursion for canonical labeling
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Classifying graphs using theoretical metrics: a study of feasibility
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications
Isomorphism Testing via Polynomial-Time Graph Extensions
Journal of Mathematical Modelling and Algorithms
Defect-Aware Nanocrossbar Logic Mapping through Matrix Canonization Using Two-Dimensional Radix Sort
ACM Journal on Emerging Technologies in Computing Systems (JETC)
Improved automated reaction mapping
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Physically-motivated dynamical algorithms for the graph isomorphism problem
Quantum Information & Computation
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Code equivalence and group isomorphism
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Testing graph isomorphism in parallel by playing a game
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Polymorphic worm detection using structural information of executables
RAID'05 Proceedings of the 8th international conference on Recent Advances in Intrusion Detection
Isomorphism for graphs of bounded feedback vertex set number
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics
On isomorphism and canonization of tournaments and hypertournaments
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
On searching for small kochen-specker vector systems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Structure theorem and isomorphism test for graphs with excluded topological subgraphs
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Isomorphism testing of boolean functions computable by constant-depth circuits
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Fixed-point definability and polynomial time on graphs with excluded minors
Journal of the ACM (JACM)
Finite model theory on tame classes of structures
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Hardness results for tournament isomorphism and automorphism
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Quasipolynomial-time canonical form for steiner designs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Multi-stage design for quasipolynomial-time isomorphism testing of steiner 2-systems
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On the isomorphism problem for decision trees and decision lists
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Faster reaction mapping through improved naming techniques
Journal of Experimental Algorithmics (JEA)
On the automorphism groups of strongly regular graphs I
Proceedings of the 5th conference on Innovations in theoretical computer science
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
| Hi-index | 0.00 |
We announce an algebraic approach to the problem of assigning canonical forms to graphs. We compute canonical forms and the associated canonical labelings (or renumberings) in polynomial time for graphs of bounded valence, in moderately exponential, exp(n½ + &ogr;(1)),time for general graphs, in subexponential, nlog n, time for tournaments and for 2-(&ngr;,&kgr;,&lgr;) block designs with &kgr;,&lgr; bounded and nlog log n time for &lgr;-planes (symmetric designs) with &lgr; bounded. We prove some related problems NP-hard and indicate some open problems.