Can I read A New Refinement Procedure for Graph Isomorphism Algorithms on EtoBox?

A New Refinement Procedure for Graph Isomorphism Algorithms by Mateus de Oliveira Oliveira; Fabíola Greve is a Computer Science article available to read on EtoBox.

What is A New Refinement Procedure for Graph Isomorphism Algorithms about?

Two vertices of a graph are said to be similar if there exists a graph automorphism mapping one of them into the other. Procedures aiming to separate vertices of a graph into equivalence classes accordingly to their similarities are the basis of many isomorphism-testing algorithms. In practice, these procedures efficiently reduce the search space of backtracking-based techniques. We present a new refinement procedure that associates to each pair of vertices the value of an arbitrary predefined invariant. We also propose such a new invariant that we call the least colored shortest path.

Who reads A New Refinement Procedure for Graph Isomorphism Algorithms?

Author

Mateus de Oliveira Oliveira; Fabíola Greve

Publisher

Elsevier Science; Elsevier ; Elsevier BV; Amsterdam: Elsevier BV (ISSN 1571-0653)

Published

2005

Language

EN

Field

Computer Science (Physical Sciences)