Compatible topologies on graphs: an application to graph isomorphism problem complexity (Q2508982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5066120
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Compatible topologies on graphs: an application to graph isomorphism problem complexity |
scientific article; zbMATH DE number 5066120 |
Statements
Compatible topologies on graphs: an application to graph isomorphism problem complexity (English)
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
0.7613081336021423
0 references
0.7529821395874023
0 references
0.7529821395874023
0 references
0.7519344687461853
0 references
