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

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2018560356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparability Graphs and Digital Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4456998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4273947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Topological Approach to Digital Topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Geometry for Computer Imagery / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Jordan surface theorem for three-dimensional digital spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4191285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph isomorphism, general remarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325461 / rank
 
Normal rank

Latest revision as of 22:00, 24 June 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references