5473 search results - page 3 / 1095 » On the graph isomorphism problem |
CPAIOR
2004
Springer
13 years 10 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
MFCS
2009
Springer
13 years 10 months ago
2009
Springer
In this paper we first explore the group theoretic techniques developed for graph isomorphism. We specifically discuss the techniques developed by Luks for solving constrained v...
FOCS
2000
IEEE
13 years 10 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
AMAI
2004
Springer
13 years 11 months ago
2004
Springer
In this paper the use of graph isomorphism is investigated within the framework of symmetry breaking in constraint satisfaction problems. A running example of Comma-free codes is ...
EJC
2010
13 years 6 months ago
2010
The paper contains a construction of a universal countable graph, different from the Rado graph, such that for any of its vertices both the neighbourhood and the non-neighbourhood ...