Graph isomorphism (English Wikipedia)

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

refsWebsite

Global rank English rank

7doi.org

2^nd place

2quantamagazine.org

6,413^th place

4,268^th place

2springer.com

274^th place

309^th place

2ams.org

451^st place

277^th place

2semanticscholar.org

11^th place

8^th place

1acm.org

1,185^th place

840^th place

1books.google.com

3^rd place

1handle.net

102^nd place

76^th place

1jstor.org

26^th place

20^th place

1uchicago.edu

230^th place

214^th place

1arxiv.org

69^th place

59^th place

1psu.edu

207^th place

136^th place

acm.org

cacm.acm.org

Grohe, Martin (2020-11-01). "The Graph Isomorphism Problem". Communications of the ACM. 63 (11): 128–134. doi:10.1145/3372123. Retrieved 2023-03-06.{{cite journal}}: CS1 maint: date and year (link)

ams.org

mathscinet.ams.org

Babai, László (2016), "Graph isomorphism in quasipolynomial time [extended abstract]", STOC'16—Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, pp. 684–697, doi:10.1145/2897518.2897542, MR 3536606, S2CID 17118954
Babai, László (2018), "Group, graphs, algorithms: the graph isomorphism problem", Proceedings of the International Congress of Mathematicians—Rio de Janeiro 2018. Vol. IV. Invited lectures, World Sci. Publ., Hackensack, NJ, pp. 3319–3336, MR 3966534

arxiv.org

Huang, Ningyuan Teresa; Villar, Soledad (2021). "A Short Tutorial on the Weisfeiler-Lehman Test and Its Variants". ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 8533–8537. arXiv:2201.07083. doi:10.1109/ICASSP39728.2021.9413523. ISBN 978-1-7281-7605-5. S2CID 235780517.

books.google.com

p.424

doi.org

Grohe, Martin (2020-11-01). "The Graph Isomorphism Problem". Communications of the ACM. 63 (11): 128–134. doi:10.1145/3372123. Retrieved 2023-03-06.{{cite journal}}: CS1 maint: date and year (link)
Hsieh, Shu-Ming; Hsu, Chiun-Chieh; Hsu, Li-Fu (2006). "Efficient Method to Perform Isomorphism Testing of Labeled Graphs". Computational Science and Its Applications - ICCSA 2006. Lecture Notes in Computer Science. Vol. 3984. pp. 422–431. doi:10.1007/11751649_46. ISBN 978-3-540-34079-9.
Whitney, Hassler (January 1932). "Congruent Graphs and the Connectivity of Graphs". American Journal of Mathematics. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.
Schöning, Uwe (1988). "Graph isomorphism is in the low hierarchy". Journal of Computer and System Sciences. 37 (3): 312–323. doi:10.1016/0022-0000(88)90010-4.
Cho, Adrian (November 10, 2015), "Mathematician claims breakthrough in complexity theory", Science, doi:10.1126/science.aad7416.
Babai, László (2016), "Graph isomorphism in quasipolynomial time [extended abstract]", STOC'16—Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, pp. 684–697, doi:10.1145/2897518.2897542, MR 3536606, S2CID 17118954
Huang, Ningyuan Teresa; Villar, Soledad (2021). "A Short Tutorial on the Weisfeiler-Lehman Test and Its Variants". ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 8533–8537. arXiv:2201.07083. doi:10.1109/ICASSP39728.2021.9413523. ISBN 978-1-7281-7605-5. S2CID 235780517.

handle.net

hdl.handle.net

Whitney, Hassler (January 1932). "Congruent Graphs and the Connectivity of Graphs". American Journal of Mathematics. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.

jstor.org

Whitney, Hassler (January 1932). "Congruent Graphs and the Connectivity of Graphs". American Journal of Mathematics. 54 (1): 150–168. doi:10.2307/2371086. hdl:10338.dmlcz/101067. JSTOR 2371086.

psu.edu

citeseerx.ist.psu.edu

Cordella, L. P.; Foggia, P.; Sansone, C.; Vento, M. (2001). "An Improved Algorithm for Matching Large Graphs". 3rd IAPR-TC15 Workshop on Graph-based Representations in Pattern Recognition: 149–159.

quantamagazine.org

Klarreich, Erica (2015-12-14). "Landmark Algorithm Breaks 30-Year Impasse". Quanta Magazine. Retrieved 2023-03-06.
Klarreich, Erica (December 14, 2015), "Landmark Algorithm Breaks 30-Year Impasse", Quanta Magazine

semanticscholar.org

api.semanticscholar.org

Babai, László (2016), "Graph isomorphism in quasipolynomial time [extended abstract]", STOC'16—Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, ACM, New York, pp. 684–697, doi:10.1145/2897518.2897542, MR 3536606, S2CID 17118954
Huang, Ningyuan Teresa; Villar, Soledad (2021). "A Short Tutorial on the Weisfeiler-Lehman Test and Its Variants". ICASSP 2021 - 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). pp. 8533–8537. arXiv:2201.07083. doi:10.1109/ICASSP39728.2021.9413523. ISBN 978-1-7281-7605-5. S2CID 235780517.

springer.com

link.springer.com

Hsieh, Shu-Ming; Hsu, Chiun-Chieh; Hsu, Li-Fu (2006). "Efficient Method to Perform Isomorphism Testing of Labeled Graphs". Computational Science and Its Applications - ICCSA 2006. Lecture Notes in Computer Science. Vol. 3984. pp. 422–431. doi:10.1007/11751649_46. ISBN 978-3-540-34079-9.
Pierre-Antoine Champin, Christine Solnon, "Measuring the Similarity of Labeled Graphs" in: Lecture Notes in Computer Science, vol. 2689, pp 80–95

uchicago.edu

people.cs.uchicago.edu

Babai, László (January 9, 2017), Graph isomorphism update