Compatible topologies on graphs: an application to graph isomorphism problem complexity (Q2508982)

From MaRDI portal
Revision as of 22:00, 24 June 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
Compatible topologies on graphs: an application to graph isomorphism problem complexity
scientific article

    Statements

    Compatible topologies on graphs: an application to graph isomorphism problem complexity (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2006
    0 references
    graph isomorphism problem
    0 references
    compatible topology on graph
    0 references
    homeomorphism problem
    0 references
    complexity theory
    0 references
    polynomial-time equivalence
    0 references

    Identifiers

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