Colour refinement algorithm (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Colour refinement algorithm" in English language version.

refsWebsite
Global rank English rank
2nd place
2nd place
11th place
8th place
69th place
59th place
5th place
5th place
low place
6,473rd place
652nd place
515th place

arxiv.org

doi.org

  • Grohe, Martin; Kersting, Kristian; Mladenov, Martin; Schweitzer, Pascal (2021). "Color Refinement and Its Applications". An Introduction to Lifted Probabilistic Inference. doi:10.7551/mitpress/10548.003.0023. ISBN 9780262365598. S2CID 59069015.
  • Cardon, A.; Crochemore, M. (1982-07-01). "Partitioning a graph in O(¦A¦log2¦V¦)". Theoretical Computer Science. 19 (1): 85–98. doi:10.1016/0304-3975(82)90016-0. ISSN 0304-3975.
  • Berkholz, Christoph; Bonsma, Paul; Grohe, Martin (2017-05-01). "Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement". Theory of Computing Systems. 60 (4): 581–614. arXiv:1509.08251. doi:10.1007/s00224-016-9686-0. ISSN 1433-0490. S2CID 12616856.
  • Grohe, Martin (2021-06-29). "The Logic of Graph Neural Networks". 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS '21. New York, NY, USA: Association for Computing Machinery. pp. 1–17. arXiv:2104.14624. doi:10.1109/LICS52264.2021.9470677. ISBN 978-1-6654-4895-6. S2CID 233476550.
  • Babai, László; Erdo˝s, Paul; Selkow, Stanley M. (August 1980). "Random Graph Isomorphism". SIAM Journal on Computing. 9 (3): 628–635. doi:10.1137/0209047. ISSN 0097-5397.
  • Babai, L.; Kucera, K. (1979). "Canonical labelling of graphs in linear average time". 20th Annual Symposium on Foundations of Computer Science (SFCS 1979). pp. 39–46. doi:10.1109/SFCS.1979.8. Retrieved 2024-01-18.

ieee.org

ieeexplore.ieee.org

semanticscholar.org

api.semanticscholar.org

  • Grohe, Martin; Kersting, Kristian; Mladenov, Martin; Schweitzer, Pascal (2021). "Color Refinement and Its Applications". An Introduction to Lifted Probabilistic Inference. doi:10.7551/mitpress/10548.003.0023. ISBN 9780262365598. S2CID 59069015.
  • Berkholz, Christoph; Bonsma, Paul; Grohe, Martin (2017-05-01). "Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement". Theory of Computing Systems. 60 (4): 581–614. arXiv:1509.08251. doi:10.1007/s00224-016-9686-0. ISSN 1433-0490. S2CID 12616856.
  • Grohe, Martin (2021-06-29). "The Logic of Graph Neural Networks". 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). LICS '21. New York, NY, USA: Association for Computing Machinery. pp. 1–17. arXiv:2104.14624. doi:10.1109/LICS52264.2021.9470677. ISBN 978-1-6654-4895-6. S2CID 233476550.

siam.org

epubs.siam.org

worldcat.org

search.worldcat.org