## Partitioning a graph in $$O(|A|\log_ 2|V|)$$.(English)Zbl 0478.68067

### MSC:

 68R10 Graph theory (including graph drawing) in computer science
Full Text:

### References:

 [1] Aho, A.V.; Hopcroft, J.E.; Ullman, J.D., The design and analysis of computer algorithms, (1974), Addison-Wesley Reading, MA · Zbl 0207.01701 [2] Corneil, D.G.; Gotlieb, C.C., An efficient algorithm for graph isomorphism, J. ACM, 17, 51-64, (1970) · Zbl 0199.27801 [3] Fontet, M., Connectivité des graphes et automorphismes des Cartes: propriétés et algorithmes, () [4] Hopcroft, J.E., An n log n algorithm for minimizing states in a finite automaton, Kohavi and paz, 189-196, (1971) [5] Moore, E.F., Sequential machines: selected papers, (1964), Addison-Wesley Reading, MA · Zbl 0147.24107 [6] Read, R.C.; Corneil, D.G., The graph isomorphism disease, J. graph theory, 1, 339-363, (1977) · Zbl 0381.05026
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.