Graph automorphism (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Graph automorphism" in English language version.

refsWebsite

Global rank English rank

8doi.org

2^nd place

3worldcat.org

5^th place

3web.archive.org

1^st place

2ams.org

451^st place

277^th place

2semanticscholar.org

11^th place

8^th place

2umich.edu

459^th place

360^th place

1numdam.org

8,650^th place

7,668^th place

1zbmath.org

1,923^rd place

1,068^th place

1math.ca

low place

1arxiv.org

69^th place

59^th place

1wikipedia.org

low place

1uni-ulm.de

low place

1anu.edu.au

942^nd place

597^th place

1unibas.ch

low place

ams.org

mathscinet.ams.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism", SIAM Journal on Computing, 10 (1): 11–21, doi:10.1137/0210002, MR 0605600.

anu.edu.au

cs.anu.edu.au

McKay, Brendan (1981), "Practical Graph Isomorphism" (PDF), Congressus Numerantium, 30: 45–87, retrieved 14 April 2011.

arxiv.org

Dona, Daniele; Bajpai, Jitendra; Helfgott, Harald Andrés (October 12, 2017). "Graph isomorphisms in quasi-polynomial time". arXiv:1710.04574 [math.GR].

doi.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
Mathon, R. (1979). "A note on the graph isomorphism counting problem". Information Processing Letters. 8 (3): 131–132. doi:10.1016/0020-0190(79)90004-8.
Lubiw, Anna (1981), "Some NP-complete problems similar to graph isomorphism", SIAM Journal on Computing, 10 (1): 11–21, doi:10.1137/0210002, MR 0605600.
Luks, Eugene M. (1982), "Isomorphism of graphs of bounded valence can be tested in polynomial time", Journal of Computer and System Sciences, 25 (1): 42–65, doi:10.1016/0022-0000(82)90009-5.
Torán, Jacobo (2004). "On the hardness of graph isomorphism" (PDF). SIAM Journal on Computing. 33 (5): 1093–1108. doi:10.1137/S009753970241096X. Archived from the original (PDF) on 2008-11-20. Retrieved 2010-03-10.
Darga, Paul; Sakallah, Karem; Markov, Igor L. (June 2008), "Faster symmetry discovery using sparsity of symmetries", Proceedings of the 45th annual Design Automation Conference (PDF), pp. 149–154, doi:10.1145/1391469.1391509, ISBN 978-1-60558-115-6, S2CID 15629172, archived from the original (PDF) on 2021-01-26, retrieved 2011-04-14.
Di Battista, Giuseppe; Tamassia, Roberto; Tollis, Ioannis G. (1992), "Area requirement and symmetry display of planar upward drawings", Discrete and Computational Geometry, 7 (1): 381–401, doi:10.1007/BF02187850; Eades, Peter; Lin, Xuemin (2000), "Spring algorithms and symmetry", Theoretical Computer Science, 240 (2): 379–405, doi:10.1016/S0304-3975(99)00239-X.
Hong, Seok-Hee (2002), "Drawing graphs symmetrically in three dimensions", Proc. 9th Int. Symp. Graph Drawing (GD 2001), Lecture Notes in Computer Science, vol. 2265, Springer-Verlag, pp. 106–108, doi:10.1007/3-540-45848-4_16, ISBN 978-3-540-43309-5.

math.ca

cms.math.ca

Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.

numdam.org

Frucht, R. (1938), "Herstellung von Graphen mit vorgegebener abstrakter Gruppe", Compositio Mathematica (in German), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804.

semanticscholar.org

api.semanticscholar.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
Darga, Paul; Sakallah, Karem; Markov, Igor L. (June 2008), "Faster symmetry discovery using sparsity of symmetries", Proceedings of the 45th annual Design Automation Conference (PDF), pp. 149–154, doi:10.1145/1391469.1391509, ISBN 978-1-60558-115-6, S2CID 15629172, archived from the original (PDF) on 2021-01-26, retrieved 2011-04-14.

umich.edu

vlsicad.eecs.umich.edu

Darga, Paul; Sakallah, Karem; Markov, Igor L. (June 2008), "Faster symmetry discovery using sparsity of symmetries", Proceedings of the 45th annual Design Automation Conference (PDF), pp. 149–154, doi:10.1145/1391469.1391509, ISBN 978-1-60558-115-6, S2CID 15629172, archived from the original (PDF) on 2021-01-26, retrieved 2011-04-14.

eecs.umich.edu

Katebi, Hadi; Sakallah, Karem; Markov, Igor L. (July 2010), "Symmetry and Satisfiability: An Update" (PDF), Proc. Satisfiability Symposium (SAT).

uni-ulm.de

theorie.informatik.uni-ulm.de

Torán, Jacobo (2004). "On the hardness of graph isomorphism" (PDF). SIAM Journal on Computing. 33 (5): 1093–1108. doi:10.1137/S009753970241096X. Archived from the original (PDF) on 2008-11-20. Retrieved 2010-03-10.

unibas.ch

ai.cs.unibas.ch

Junttila, Tommi; Kaski, Petteri (2007), "Engineering an efficient canonical labeling tool for large and sparse graphs" (PDF), Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX07).

web.archive.org

Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
Torán, Jacobo (2004). "On the hardness of graph isomorphism" (PDF). SIAM Journal on Computing. 33 (5): 1093–1108. doi:10.1137/S009753970241096X. Archived from the original (PDF) on 2008-11-20. Retrieved 2010-03-10.
Darga, Paul; Sakallah, Karem; Markov, Igor L. (June 2008), "Faster symmetry discovery using sparsity of symmetries", Proceedings of the 45th annual Design Automation Conference (PDF), pp. 149–154, doi:10.1145/1391469.1391509, ISBN 978-1-60558-115-6, S2CID 15629172, archived from the original (PDF) on 2021-01-26, retrieved 2011-04-14.

wikipedia.org

de.wikipedia.org

Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1993), Graph Isomorphism Problem: The Structural Complexity, Birkhäuser Verlag, ISBN 0-8176-3680-3, OCLC 246882287

worldcat.org

search.worldcat.org

Frucht, R. (1938), "Herstellung von Graphen mit vorgegebener abstrakter Gruppe", Compositio Mathematica (in German), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804.
Frucht, R. (1949), "Graphs of degree three with a given abstract group" (PDF), Canadian Journal of Mathematics, 1 (4): 365–378, doi:10.4153/CJM-1949-033-6, ISSN 0008-414X, MR 0032987, S2CID 124723321, archived from the original on Jun 9, 2012.
Köbler, Johannes; Schöning, Uwe; Torán, Jacobo (1993), Graph Isomorphism Problem: The Structural Complexity, Birkhäuser Verlag, ISBN 0-8176-3680-3, OCLC 246882287

zbmath.org

Frucht, R. (1938), "Herstellung von Graphen mit vorgegebener abstrakter Gruppe", Compositio Mathematica (in German), 6: 239–250, ISSN 0010-437X, Zbl 0020.07804.