Practical graph isomorphism. II. (Q2437295): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: nauty / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Saucy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: geng / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: conauto / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990600049 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q99301767 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1301.1493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general backtrack algorithm for the isomorphism problem of combinatorial objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Graph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict Propagation and Component Recursion for Canonical Labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a class of infinite permutation groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isomorphism of graphs of bounded valence can be tested in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4194477 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3671211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Errors in graph embedding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph isomorphism disease / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787523 / rank
 
Normal rank

Latest revision as of 09:38, 7 July 2024

scientific article
Language Label Description Also known as
English
Practical graph isomorphism. II.
scientific article

    Statements

    Practical graph isomorphism. II. (English)
    0 references
    0 references
    0 references
    3 March 2014
    0 references
    graph isomorphism
    0 references
    canonical labelling
    0 references
    nauty
    0 references
    traces
    0 references
    partition refinement
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references