Partitioning a graph in O(|A|log2|V|)

Theoretical Computer Science

Volumn 19, Issue 1, 1982, Pages 85-98

  Cardon, A ^a   Crochemore, M ^a  

^a UNIVERSITÉ DE ROUEN   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0004425081     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(82)90016-0     Document Type: Article

References (6)

1. An efficient algorithm for graph isomorphism
2. Connectivité des graphes et automorphismes des cartes: propriétés et algorithmes
3. An n log n algorithm for minimizing states in a finite automaton
4. The graph isomorphism disease