Maximum common induced subgraph (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Maximum common induced subgraph" in English language version.

refsWebsite

Global rank English rank

10doi.org

2^nd place

3semanticscholar.org

11^th place

8^th place

3worldcat.org

5^th place

1weizmann.ac.il

4,983^rd place

8,002^nd place

1hal.science

low place

1wiley.com

222^nd place

297^th place

1whiterose.ac.uk

4,124^th place

2,320^th place

1harvard.edu

18^th place

17^th place

1nih.gov

4^th place

1worldscientific.com

low place

9,148^th place

doi.org (Global: 2^nd place; English: 2^nd place)

Kann, Viggo (1992), "On the approximability of the maximum common subgraph problem", STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science Cachan, France, February 13–15, 1992, Proceedings, Lecture Notes in Computer Science, vol. 577, Springer Science $\mathplus$ Business Media, pp. 375–388, doi:10.1007/3-540-55210-3_198, ISBN 978-3-540-55210-9.
Zuckerman, D. (2006), "Linear degree extractors and the inapproximability of max clique and chromatic number", Proc. 38th ACM Symp. Theory of Computing, pp. 681–690, doi:10.1145/1132516.1132612, ISBN 1-59593-134-1, S2CID 5713815, ECCC TR05-100.
Barrow, H.; Burstall, R. (1976), "Subgraph isomorphism, matching relational structures and maximal cliques", Information Processing Letters, 4 (4): 83–84, doi:10.1016/0020-0190(76)90049-1.
McCreesh, Ciaran; Ndiaye, Samba Ndojh; Prosser, Patrick; Solnon, Christine (2016), "Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems", Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9892, Springer International Publishing, pp. 350–368, doi:10.1007/978-3-319-44953-1_23, ISBN 978-3-319-44952-4, S2CID 215812381
McCreesh, Ciaran; Prosser, Patrick; Trimble, James (2017), "A Partitioning Algorithm for Maximum Common Subgraph Problems", Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017, ijcai.org, pp. 712–719, doi:10.24963/ijcai.2017/99, ISBN 9780999241103
Calabrese, Andrea; Cardone, Lorenzo; Licata, Salvatore; Porro, Marco; Quer, Stefano (2023). A Web Scraping Algorithm to Improve the Computation of the Maximum Common Subgraph. SCITEPRESS - Science and Technology Publications. pp. 197–206. doi:10.5220/0012130800003538. ISBN 978-989-758-665-1.
Schietgat, Leander; Ramon, Jan; Bruynooghe, Maurice (2013-12-01). "A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics". Annals of Mathematics and Artificial Intelligence. 69 (4): 343–376. doi:10.1007/s10472-013-9335-0. ISSN 1573-7470.
Ehrlich, Hans-Christian; Rarey, Matthias (2011). "Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review". WIREs Computational Molecular Science. 1 (1): 68–79. doi:10.1002/wcms.5. ISSN 1759-0876.
Raymond, John W.; Willett, Peter (2002), "Maximum common subgraph isomorphism algorithms for the matching of chemical structures" (PDF), Journal of Computer-Aided Molecular Design, 16 (7): 521–533, Bibcode:2002JCAMD..16..521R, doi:10.1023/A:1021271615909, PMID 12510884, S2CID 5202419.
Conte, D.; Foggia, P.; Sansone, C.; Vento, M. (2004). "Thirty Years of Graph Matching in Pattern Recognition". International Journal of Pattern Recognition and Artificial Intelligence. 18 (3): 265–298. doi:10.1142/S0218001404003228. ISSN 0218-0014.

hal.science (Global: low place; English: low place)

McCreesh, Ciaran; Ndiaye, Samba Ndojh; Prosser, Patrick; Solnon, Christine (2016), "Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems", Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9892, Springer International Publishing, pp. 350–368, doi:10.1007/978-3-319-44953-1_23, ISBN 978-3-319-44952-4, S2CID 215812381

harvard.edu (Global: 18^th place; English: 17^th place)

ui.adsabs.harvard.edu

Raymond, John W.; Willett, Peter (2002), "Maximum common subgraph isomorphism algorithms for the matching of chemical structures" (PDF), Journal of Computer-Aided Molecular Design, 16 (7): 521–533, Bibcode:2002JCAMD..16..521R, doi:10.1023/A:1021271615909, PMID 12510884, S2CID 5202419.

nih.gov (Global: 4^th place; English: 4^th place)

pubmed.ncbi.nlm.nih.gov

Raymond, John W.; Willett, Peter (2002), "Maximum common subgraph isomorphism algorithms for the matching of chemical structures" (PDF), Journal of Computer-Aided Molecular Design, 16 (7): 521–533, Bibcode:2002JCAMD..16..521R, doi:10.1023/A:1021271615909, PMID 12510884, S2CID 5202419.

semanticscholar.org (Global: 11^th place; English: 8^th place)

api.semanticscholar.org

Zuckerman, D. (2006), "Linear degree extractors and the inapproximability of max clique and chromatic number", Proc. 38th ACM Symp. Theory of Computing, pp. 681–690, doi:10.1145/1132516.1132612, ISBN 1-59593-134-1, S2CID 5713815, ECCC TR05-100.
McCreesh, Ciaran; Ndiaye, Samba Ndojh; Prosser, Patrick; Solnon, Christine (2016), "Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems", Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9892, Springer International Publishing, pp. 350–368, doi:10.1007/978-3-319-44953-1_23, ISBN 978-3-319-44952-4, S2CID 215812381
Raymond, John W.; Willett, Peter (2002), "Maximum common subgraph isomorphism algorithms for the matching of chemical structures" (PDF), Journal of Computer-Aided Molecular Design, 16 (7): 521–533, Bibcode:2002JCAMD..16..521R, doi:10.1023/A:1021271615909, PMID 12510884, S2CID 5202419.

weizmann.ac.il (Global: 4,983^rd place; English: 8,002^nd place)

eccc.weizmann.ac.il

Zuckerman, D. (2006), "Linear degree extractors and the inapproximability of max clique and chromatic number", Proc. 38th ACM Symp. Theory of Computing, pp. 681–690, doi:10.1145/1132516.1132612, ISBN 1-59593-134-1, S2CID 5713815, ECCC TR05-100.

whiterose.ac.uk (Global: 4,124^th place; English: 2,320^th place)

eprints.whiterose.ac.uk

Raymond, John W.; Willett, Peter (2002), "Maximum common subgraph isomorphism algorithms for the matching of chemical structures" (PDF), Journal of Computer-Aided Molecular Design, 16 (7): 521–533, Bibcode:2002JCAMD..16..521R, doi:10.1023/A:1021271615909, PMID 12510884, S2CID 5202419.

wiley.com (Global: 222^nd place; English: 297^th place)

wires.onlinelibrary.wiley.com

Ehrlich, Hans-Christian; Rarey, Matthias (2011). "Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review". WIREs Computational Molecular Science. 1 (1): 68–79. doi:10.1002/wcms.5. ISSN 1759-0876.

worldcat.org (Global: 5^th place; English: 5^th place)

search.worldcat.org

Schietgat, Leander; Ramon, Jan; Bruynooghe, Maurice (2013-12-01). "A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics". Annals of Mathematics and Artificial Intelligence. 69 (4): 343–376. doi:10.1007/s10472-013-9335-0. ISSN 1573-7470.
Ehrlich, Hans-Christian; Rarey, Matthias (2011). "Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review". WIREs Computational Molecular Science. 1 (1): 68–79. doi:10.1002/wcms.5. ISSN 1759-0876.
Conte, D.; Foggia, P.; Sansone, C.; Vento, M. (2004). "Thirty Years of Graph Matching in Pattern Recognition". International Journal of Pattern Recognition and Artificial Intelligence. 18 (3): 265–298. doi:10.1142/S0218001404003228. ISSN 0218-0014.

worldscientific.com (Global: low place; English: 9,148^th place)

Conte, D.; Foggia, P.; Sansone, C.; Vento, M. (2004). "Thirty Years of Graph Matching in Pattern Recognition". International Journal of Pattern Recognition and Artificial Intelligence. 18 (3): 265–298. doi:10.1142/S0218001404003228. ISSN 0218-0014.

Maximum common induced subgraph (English Wikipedia)

doi.org (Global: 2nd place; English: 2nd place)

hal.science (Global: low place; English: low place)

harvard.edu (Global: 18th place; English: 17th place)

ui.adsabs.harvard.edu

nih.gov (Global: 4th place; English: 4th place)