Editing Subgraph isomorphism problem (section)

==References==
*{{Citation|first=S. A.|last=Cook|authorlink=Stephen Cook|contribution=The complexity of theorem-proving procedures|year=1971|title=Proc. 3rd ACM Symposium on Theory of Computing|pages=151–158|contribution-url=http://4mhz.de/cook.html|doi=10.1145/800157.805047|title-link=Symposium on Theory of Computing|s2cid=7573663 |doi-access=free}}.
*{{Citation|last=Eppstein|first=David|authorlink=David Eppstein|title=Subgraph isomorphism in planar graphs and related problems|journal=[[Journal of Graph Algorithms and Applications]]|volume=3|issue=3|pages=1–27|year=1999|url=http://www.cs.brown.edu/publications/jgaa/accepted/99/Eppstein99.3.3.pdf|arxiv=cs.DS/9911003|doi=10.7155/jgaa.00014|s2cid=2303110 }}.
*{{Citation|author1-link = Michael R. Garey|last1=Garey|first1=Michael R.|author2-link = David S. Johnson | last2=Johnson | first2 = David S. | year = 1979 | title = Computers and Intractability: A Guide to the Theory of NP-Completeness | publisher = W.H. Freeman | isbn = 978-0-7167-1045-5|title-link=Computers and Intractability: A Guide to the Theory of NP-Completeness}}. A1.4: GT48, pg.202.
*{{Citation
| volume = 10
| issue = 3
| pages = 119–127
| last = Gröger
| first =  Hans Dietmar
| title = On the randomized complexity of monotone graph properties
| journal = Acta Cybernetica
| year = 1992
| url = http://www.inf.u-szeged.hu/actacybernetica/edb/vol10n3/pdf/Groger_1992_ActaCybernetica.pdf
}}.
*{{Citation|
journal=SIGMOD|
first1=Myoungji|
last1=Han |
first2=Hyunjoon|
last2=  Kim |
first3=Geonmo|
last3=  Gu |
first4=Kunsoo|
last4=  Park| 
first5=Wookshin |
last5= Han| 
year=2019|
title=Efficient Subgraph Matching: Harmonizing Dynamic Programming, Adaptive Matching Order, and Failing Set Together|
doi=10.1145/3299869.3319880|
s2cid=195259296}}
*{{Citation|first1=Michihiro|last1=Kuramochi|first2=George|last2=Karypis|contribution=Frequent subgraph discovery|title=1st IEEE International Conference on Data Mining|year=2001|page=313|doi=10.1109/ICDM.2001.989534|isbn=978-0-7695-1119-1|citeseerx=10.1.1.22.4992|s2cid=8684662 }}.
*{{Citation|first1=Miles|last1=Ohlrich|first2=Carl|last2=Ebeling|first3=Eka|last3=Ginting|first4=Lisa|last4=Sather|contribution=SubGemini: identifying subcircuits using a fast subgraph isomorphism algorithm|title=Proceedings of the 30th international Design Automation Conference|year=1993|pages=31–37|doi=10.1145/157485.164556|isbn=978-0-89791-577-9|s2cid=5889119 |doi-access=free}}.
*{{citation
 | last1 = Nešetřil | first1 = Jaroslav | author1-link = Jaroslav Nešetřil
 | last2 = Ossona de Mendez | first2 = Patrice | author2-link = Patrice Ossona de Mendez
 | contribution = 18.3 The subgraph isomorphism problem and Boolean queries
 | doi = 10.1007/978-3-642-27875-4
 | isbn = 978-3-642-27874-7
 | mr = 2920058
 | pages = 400–401
 | publisher = Springer
 | series = Algorithms and Combinatorics
 | title = Sparsity: Graphs, Structures, and Algorithms
 | volume = 28
 | year = 2012 }}.
*{{Citation|first1=N.|last1=Pržulj|first2=D. G.|last2=Corneil|author2-link=Derek Corneil|first3=I.|last3=Jurisica|title=Efficient estimation of graphlet frequency distributions in protein–protein interaction networks|journal=Bioinformatics|volume=22|issue=8|pages=974–980|year=2006|doi=10.1093/bioinformatics/btl030|pmid=16452112|doi-access=free}}.
*{{Citation|first1=T. A. B.|last1=Snijders|first2=P. E.|last2=Pattison|first3=G.|last3=Robins|first4=M. S.|last4=Handcock|title=New specifications for exponential random graph models|journal=Sociological Methodology|volume=36|issue=1|pages=99–153|year=2006|doi=10.1111/j.1467-9531.2006.00176.x|citeseerx=10.1.1.62.7975|s2cid=10800726 }}.
*{{Citation|first=Julian R.|last=Ullmann|year=1976|title=An algorithm for subgraph isomorphism|journal=[[Journal of the ACM]]|volume=23|issue=1|pages=31–42|doi=10.1145/321921.321925|s2cid=17268751 |doi-access=free}}.
*{{Citation|first=Hasan|last=Jamil|contribution=Computing Subgraph Isomorphic Queries using Structural Unification and Minimum Graph Structures|year=2011|title=26th ACM Symposium on Applied Computing|pages=1058–1063}}.
*{{Citation|first=Julian R.|last=Ullmann|year=2010|title=Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism|journal=[[Journal of Experimental Algorithmics]]|volume=15|pages=1.1|doi=10.1145/1671970.1921702|citeseerx=10.1.1.681.8766|s2cid=15021184 }}.
*{{Citation|first=Luigi P.|last=Cordella|year=2004|title=A (sub) graph isomorphism algorithm for matching large graphs|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence|volume=26|issue=10|pages=1367–1372|doi=10.1109/tpami.2004.75|citeseerx=10.1.1.101.5342|pmid=15641723|s2cid=833657 }}
*{{Citation|first1=V.|last1=Bonnici|first2=R.|last2=Giugno|year=2013|title=A subgraph isomorphism algorithm and its application to biochemical data|journal=BMC Bioinformatics|volume=14(Suppl7)|issue=13|pages=S13|doi=10.1186/1471-2105-14-s7-s13|pmid=23815292|pmc=3633016 |doi-access=free }}
*{{Citation|first1=V.|last1=Carletti|first2=P.|last2=Foggia|first3=A.|last3=Saggese|first4=M.|last4=Vento|year=2018|title=Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with VF3|journal=IEEE Transactions on Pattern Analysis and Machine Intelligence|volume=40|issue=4|pages=804–818|doi=10.1109/TPAMI.2017.2696940|pmid=28436848|s2cid=3709576 }}
*{{Citation
  | last1=Solnon | first1=Christine
  | title=Graph-Based Representations in Pattern Recognition - 12th IAPR-TC-15 International Workshop, GbRPR 2019, Tours, France, June 19-21, 2019, Proceedings
  | chapter=Experimental Evaluation of Subgraph Isomorphism Solvers
  | series=Lecture Notes in Computer Science
 | publisher=Springer
  | year=2019
  | volume=11510
 | pages=1–13
  | doi=10.1007/978-3-030-20081-7_1| isbn=978-3-030-20080-0
 | s2cid=128270779
 | chapter-url=https://hal.archives-ouvertes.fr/hal-02086499/file/paper.pdf
 }}
*{{Citation
  | last1=McCreesh | first1=Ciaran
  | last2=Prosser | first2=Patrick
  | last3=Trimble | first3=James
  | title=Graph Transformation - 13th International Conference, ICGT 2020, Held as Part of STAF 2020, Bergen, Norway, June 25-26, 2020, Proceedings
  | chapter=The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
  | series=Lecture Notes in Computer Science
 | publisher=Springer
  | year=2020
  | volume=12150
 | pages=316–324
  | doi=10.1007/978-3-030-51372-6_19| isbn=978-3-030-51371-9
 | doi-access=free
  }}
{{Authority control}}

{{DEFAULTSORT:Subgraph Isomorphism Problem}}
[[Category:NP-complete problems]]
[[Category:Graph algorithms]]
[[Category:Computational problems in graph theory]]