Computational complexity of reconstruction and isomorphism testing for designs and line graphs (Q618291)

From MaRDI portal
Revision as of 16:22, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Computational complexity of reconstruction and isomorphism testing for designs and line graphs
scientific article

    Statements

    Computational complexity of reconstruction and isomorphism testing for designs and line graphs (English)
    0 references
    0 references
    14 January 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    computational complexity
    0 references
    reconstructibility
    0 references
    isomorphism testing
    0 references
    combinatorial design
    0 references
    line graph
    0 references
    graph isomorphism problem
    0 references
    hypergraph isomorphism problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references