Practical Graph Isomorphism, II¶
McKay, B. D., & Piperno, A. (2014). Practical Graph Isomorphism, II. Journal of Symbolic Computation, 94-112.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Canonical Adjacency Encoding
- Where a full graph-isomorphism test between every pair would be intractable, a canonical key turns equivalence into string equality.
This sourceMcKay and Piperno show that canonical labeling maps isomorphic graphs to equal canonical forms, enabling equivalence checks by representation equality.
- Where a full graph-isomorphism test between every pair would be intractable, a canonical key turns equivalence into string equality.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:a63a4f55285e · see in the full table