Subgraph isomorphism problem (English Wikipedia)

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

refsWebsite

Global rank English rank

8doi.org

2^nd place

6semanticscholar.org

11^th place

8^th place

2ams.org

451^st place

277^th place

2psu.edu

207^th place

136^th place

14mhz.de

low place

1brown.edu

2,481^st place

1,558^th place

1arxiv.org

69^th place

59^th place

1books.google.com

3^rd place

1univ-evry.fr

low place

1archives-ouvertes.fr

1,031^st place

879^th place

1nih.gov

4^th place

1aaai.org

9,352^nd place

5,696^th place

1llnl.gov

6,750^th place

5,140^th place

4mhz.de

The original Cook (1971) paper that proves the Cook–Levin theorem already showed subgraph isomorphism to be NP-complete, using a reduction from 3-SAT involving cliques. Cook, S. A. (1971), "The complexity of theorem-proving procedures", Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158, doi:10.1145/800157.805047, S2CID 7573663.

aaai.org

http://www.aaai.org/Papers/Symposia/Fall/2006/FS-06-02/FS06-02-007.pdf; expanded version at https://e-reports-ext.llnl.gov/pdf/332302.pdf

ams.org

mathscinet.ams.org

Eppstein (1999); Nešetřil & Ossona de Mendez (2012) Eppstein, David (1999), "Subgraph isomorphism in planar graphs and related problems" (PDF), Journal of Graph Algorithms and Applications, 3 (3): 1–27, arXiv:cs.DS/9911003, doi:10.7155/jgaa.00014, S2CID 2303110. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The subgraph isomorphism problem and Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.
de la Higuera, Colin; Janodet, Jean-Christophe; Samuel, Émilie; Damiand, Guillaume; Solnon, Christine (2013), "Polynomial algorithms for open plane graph and subgraph isomorphisms" (PDF), Theoretical Computer Science, 498: 76–99, doi:10.1016/j.tcs.2013.05.026, MR 3083515, It is known since the mid-70's that the isomorphism problem is solvable in polynomial time for plane graphs. However, it has also been noted that the subisomorphism problem is still N P-complete, in particular because the Hamiltonian cycle problem is NP-complete for planar graphs.

archives-ouvertes.fr

hal.archives-ouvertes.fr

For an experimental evaluation, see Solnon (2019). Solnon, Christine (2019), "Experimental Evaluation of Subgraph Isomorphism Solvers" (PDF), Graph-Based Representations in Pattern Recognition - 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11510, Springer, pp. 1–13, doi:10.1007/978-3-030-20081-7_1, ISBN 978-3-030-20080-0, S2CID 128270779

arxiv.org

Eppstein (1999); Nešetřil & Ossona de Mendez (2012) Eppstein, David (1999), "Subgraph isomorphism in planar graphs and related problems" (PDF), Journal of Graph Algorithms and Applications, 3 (3): 1–27, arXiv:cs.DS/9911003, doi:10.7155/jgaa.00014, S2CID 2303110. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The subgraph isomorphism problem and Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.

books.google.com

Wegener, Ingo (2005), Complexity Theory: Exploring the Limits of Efficient Algorithms, Springer, p. 81, ISBN 9783540210450.

brown.edu

cs.brown.edu

Eppstein (1999); Nešetřil & Ossona de Mendez (2012) Eppstein, David (1999), "Subgraph isomorphism in planar graphs and related problems" (PDF), Journal of Graph Algorithms and Applications, 3 (3): 1–27, arXiv:cs.DS/9911003, doi:10.7155/jgaa.00014, S2CID 2303110. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The subgraph isomorphism problem and Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.

doi.org

The original Cook (1971) paper that proves the Cook–Levin theorem already showed subgraph isomorphism to be NP-complete, using a reduction from 3-SAT involving cliques. Cook, S. A. (1971), "The complexity of theorem-proving procedures", Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158, doi:10.1145/800157.805047, S2CID 7573663.
Eppstein (1999); Nešetřil & Ossona de Mendez (2012) Eppstein, David (1999), "Subgraph isomorphism in planar graphs and related problems" (PDF), Journal of Graph Algorithms and Applications, 3 (3): 1–27, arXiv:cs.DS/9911003, doi:10.7155/jgaa.00014, S2CID 2303110. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The subgraph isomorphism problem and Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.
de la Higuera, Colin; Janodet, Jean-Christophe; Samuel, Émilie; Damiand, Guillaume; Solnon, Christine (2013), "Polynomial algorithms for open plane graph and subgraph isomorphisms" (PDF), Theoretical Computer Science, 498: 76–99, doi:10.1016/j.tcs.2013.05.026, MR 3083515, It is known since the mid-70's that the isomorphism problem is solvable in polynomial time for plane graphs. However, it has also been noted that the subisomorphism problem is still N P-complete, in particular because the Hamiltonian cycle problem is NP-complete for planar graphs.
For an experimental evaluation, see Solnon (2019). Solnon, Christine (2019), "Experimental Evaluation of Subgraph Isomorphism Solvers" (PDF), Graph-Based Representations in Pattern Recognition - 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11510, Springer, pp. 1–13, doi:10.1007/978-3-030-20081-7_1, ISBN 978-3-030-20080-0, S2CID 128270779
Ullmann (1976) Ullmann, Julian R. (1976), "An algorithm for subgraph isomorphism", Journal of the ACM, 23 (1): 31–42, doi:10.1145/321921.321925, S2CID 17268751.
Kuramochi & Karypis (2001). Kuramochi, Michihiro; Karypis, George (2001), "Frequent subgraph discovery", 1st IEEE International Conference on Data Mining, p. 313, CiteSeerX 10.1.1.22.4992, doi:10.1109/ICDM.2001.989534, ISBN 978-0-7695-1119-1, S2CID 8684662.
Pržulj, Corneil & Jurisica (2006). Pržulj, N.; Corneil, D. G.; Jurisica, I. (2006), "Efficient estimation of graphlet frequency distributions in protein–protein interaction networks", Bioinformatics, 22 (8): 974–980, doi:10.1093/bioinformatics/btl030, PMID 16452112.
Snijders et al. (2006). Snijders, T. A. B.; Pattison, P. E.; Robins, G.; Handcock, M. S. (2006), "New specifications for exponential random graph models", Sociological Methodology, 36 (1): 99–153, CiteSeerX 10.1.1.62.7975, doi:10.1111/j.1467-9531.2006.00176.x, S2CID 10800726.

llnl.gov

e-reports-ext.llnl.gov

http://www.aaai.org/Papers/Symposia/Fall/2006/FS-06-02/FS06-02-007.pdf; expanded version at https://e-reports-ext.llnl.gov/pdf/332302.pdf

nih.gov

pubmed.ncbi.nlm.nih.gov

Pržulj, Corneil & Jurisica (2006). Pržulj, N.; Corneil, D. G.; Jurisica, I. (2006), "Efficient estimation of graphlet frequency distributions in protein–protein interaction networks", Bioinformatics, 22 (8): 974–980, doi:10.1093/bioinformatics/btl030, PMID 16452112.

psu.edu

citeseerx.ist.psu.edu

Kuramochi & Karypis (2001). Kuramochi, Michihiro; Karypis, George (2001), "Frequent subgraph discovery", 1st IEEE International Conference on Data Mining, p. 313, CiteSeerX 10.1.1.22.4992, doi:10.1109/ICDM.2001.989534, ISBN 978-0-7695-1119-1, S2CID 8684662.
Snijders et al. (2006). Snijders, T. A. B.; Pattison, P. E.; Robins, G.; Handcock, M. S. (2006), "New specifications for exponential random graph models", Sociological Methodology, 36 (1): 99–153, CiteSeerX 10.1.1.62.7975, doi:10.1111/j.1467-9531.2006.00176.x, S2CID 10800726.

semanticscholar.org

api.semanticscholar.org

The original Cook (1971) paper that proves the Cook–Levin theorem already showed subgraph isomorphism to be NP-complete, using a reduction from 3-SAT involving cliques. Cook, S. A. (1971), "The complexity of theorem-proving procedures", Proc. 3rd ACM Symposium on Theory of Computing, pp. 151–158, doi:10.1145/800157.805047, S2CID 7573663.
Eppstein (1999); Nešetřil & Ossona de Mendez (2012) Eppstein, David (1999), "Subgraph isomorphism in planar graphs and related problems" (PDF), Journal of Graph Algorithms and Applications, 3 (3): 1–27, arXiv:cs.DS/9911003, doi:10.7155/jgaa.00014, S2CID 2303110. Nešetřil, Jaroslav; Ossona de Mendez, Patrice (2012), "18.3 The subgraph isomorphism problem and Boolean queries", Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Springer, pp. 400–401, doi:10.1007/978-3-642-27875-4, ISBN 978-3-642-27874-7, MR 2920058.
For an experimental evaluation, see Solnon (2019). Solnon, Christine (2019), "Experimental Evaluation of Subgraph Isomorphism Solvers" (PDF), Graph-Based Representations in Pattern Recognition - 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11510, Springer, pp. 1–13, doi:10.1007/978-3-030-20081-7_1, ISBN 978-3-030-20080-0, S2CID 128270779
Ullmann (1976) Ullmann, Julian R. (1976), "An algorithm for subgraph isomorphism", Journal of the ACM, 23 (1): 31–42, doi:10.1145/321921.321925, S2CID 17268751.
Kuramochi & Karypis (2001). Kuramochi, Michihiro; Karypis, George (2001), "Frequent subgraph discovery", 1st IEEE International Conference on Data Mining, p. 313, CiteSeerX 10.1.1.22.4992, doi:10.1109/ICDM.2001.989534, ISBN 978-0-7695-1119-1, S2CID 8684662.
Snijders et al. (2006). Snijders, T. A. B.; Pattison, P. E.; Robins, G.; Handcock, M. S. (2006), "New specifications for exponential random graph models", Sociological Methodology, 36 (1): 99–153, CiteSeerX 10.1.1.62.7975, doi:10.1111/j.1467-9531.2006.00176.x, S2CID 10800726.

univ-evry.fr

ibisc.univ-evry.fr

de la Higuera, Colin; Janodet, Jean-Christophe; Samuel, Émilie; Damiand, Guillaume; Solnon, Christine (2013), "Polynomial algorithms for open plane graph and subgraph isomorphisms" (PDF), Theoretical Computer Science, 498: 76–99, doi:10.1016/j.tcs.2013.05.026, MR 3083515, It is known since the mid-70's that the isomorphism problem is solvable in polynomial time for plane graphs. However, it has also been noted that the subisomorphism problem is still N P-complete, in particular because the Hamiltonian cycle problem is NP-complete for planar graphs.