×

Calcul du centralisateur d’un groupe de permutations. (French) Zbl 0376.20001


MSC:

20B05 General theory for finite permutation groups
20B25 Finite automorphism groups of algebraic, geometric, or combinatorial structures
05C10 Planar graphs; geometric and topological aspects of graph theory
68W99 Algorithms in computer science
68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: Numdam EuDML

References:

[1] AHO A.V. , J.F. HOPCROFT , D.D. ULLMAN . - The Design and Analysis of computer Algorithms . - Addison-Wesley ( 1974 ). Zbl 0326.68005 · Zbl 0326.68005
[2] BERGE C. - Graphes et Hypergraphes . - Dunod ( 1970 ). MR 50 #9641 | Zbl 0213.25702 · Zbl 0213.25702
[3] CORI R. - Un code pour les graphes planaires et ses applications . - Thèse Paris ( 1973 ). · Zbl 0313.05115
[4] EDMONDS J.R. - A combinatorial representation for oriented polyhedral surfaces M.A. Thesis University of Mouyland U.S.A. ( 1960 ) (5) FONTET M. - Un résultat en théorie des groupes de permutations et son application au calcul effectif du groupe d’automorphismes d’un automate fini . - 2nd Colloquium on Automata, languages and programming Saarbrücker ( 1974 ) 335-341. MR 55 #5725 | Zbl 0398.68026 · Zbl 0398.68026
[5] FONTET M. - Test d’isomorphie d’hypergraphes planaires 2nd Professional Conférence on Automata Theory and Formal Languages . - Kaiserlautern ( 1975 ) 93-98. Zbl 0316.68026 · Zbl 0316.68026
[6] FONTET M. - Test d’isomorphie de deux graphes planaires . - Journées Informatique et Combinatoire. Bordeaux ( 1975 ) Zbl 0345.05127 · Zbl 0345.05127
[7] FONTET M. - A linear algorithm for testing isomorphism of planar graphs . - Third International Colloquium on Automata, Languages and Programming Edinburg Juillet 1976 . Zbl 0351.05127 · Zbl 0351.05127
[8] HOPCROFT J.E. , R.E. TARJAN . - Isomorphism of planar graphs in complexity of Computer Computations R.E. Miller and J.W. Thatcher Eds Plenum Press New-York 131-152 ( 1972 ). MR 53 #7114 | Zbl 0436.05021 · Zbl 0436.05021
[9] HOPCROFT J.E. , R.E. TARJAN . - A V log V algorithm for isomorphism of triconnected planar graphs . - J. Comput. Syst. Sci. 7, 323-331 ( 1973 ). MR 49 #10178 | Zbl 0274.05103 · Zbl 0274.05103 · doi:10.1016/S0022-0000(73)80013-3
[10] HOPCROFT J.E. , J.K. WONG . - A linear time algorithm for isomorphism of planar graphs . - (Preliminary report). 6th ACM SIGACT ( 1974 ). MR 55 #6934 | Zbl 0369.05028 · Zbl 0369.05028
[11] JACQUES A. - Sur le genre d’une paire de substitutions . - C.R. Acad. Sci. Paris 267, 625-627 ( 1968 ). MR 41 #6950 | Zbl 0187.20902 · Zbl 0187.20902
[12] SIMS C.C. - Computational methods in the study of permutation groups . - dans J. LEECH ed. Computational problems in abstract (Pergamon Press 1970 ) 169-183. MR 41 #1856 | Zbl 0215.10002 · Zbl 0215.10002
[13] SIMS C.C. - Determining the Conjugacy Classes of a Permutation group . - SIAM - AMS Proceedings, vol IV, 191-195 ( 1971 ). MR 49 #2901 | Zbl 0253.20001 · Zbl 0253.20001
[14] WIELANDT H. - Finite Permutation groups Academic Press ( 1964 ). MR 32 #1252 | Zbl 0138.02501 · Zbl 0138.02501
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.