Corpus ID: 10433158

Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)

@article{Piperno2008SearchSC,
  title={Search Space Contraction in Canonical Labeling of Graphs (Preliminary Version)},
  author={Adolfo Piperno},
  journal={ArXiv},
  year={2008},
  volume={abs/0804.4881}
}
  • Adolfo Piperno
  • Published 2008
  • Mathematics, Computer Science
  • ArXiv
  • The individualization-refinement 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, together with graph invariants having a global nature. Experimental results and comparisons with existing tools, such as nauty, reveal that the presented approach produces a huge contraction of the… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 43 CITATIONS

    Practical graph isomorphism, II

    Novel Techniques to Speed Up the Computation of the Automorphism Group of a Graph

    VIEW 13 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    An Efficient Graph Isomorphism Algorithm Based on Canonical Labeling and Its Parallel Implementation on GPU

    • Renda Wang, Longjiang Guo, +3 authors Keqin Li
    • Computer Science
    • 2013 IEEE 10th International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing
    • 2013
    VIEW 10 EXCERPTS
    CITES METHODS
    HIGHLY INFLUENCED

    FILTER CITATIONS BY YEAR

    2009
    2020

    CITATION STATISTICS

    • 6 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES