Theta function - Revision history

en>David Eppstein: edlink [[Krishnaswami Alladi]

2015-01-12T04:14:12Z

edlink [[Krishnaswami Alladi]

← Older revision		Revision as of 06:14, 12 January 2015
Line 1:		Line 1:
	Jerrie ~~Swoboda~~ is what ~~the individual~~ can call me and ~~simply I totally dig whom name. Managing~~ people is my ~~working day~~ job ~~now~~. ~~As a girl what I really like~~ is ~~to accomplish croquet but~~ I ~~still can~~'~~t make it my vocation really~~. ~~My wife~~ and I ~~chose to measure in Massachusetts~~. Go to my ~~web site~~ to find ~~out~~ more: http://~~circuspartypanama~~.~~com~~<br><br>my ~~homepage ...~~ [http://~~circuspartypanama~~.~~com clash of clans cheats ipod~~]

			Jerrie is what you can call me but My family and i don't like when people use my full determine. The job I've been occupying for years is an actual people manager. Guam is even I've always been [https://Www.Vocabulary.com/dictionary/difficult difficult]. What I cherish doing is fish preventing and I'll be building something else along can. Go to some of my website to find apart more: http://prometeu.net<br><br>Have a look at my web-site :: clash of clans hack android ([http://prometeu.net click through the up coming post])

en>Titus III: /* Some relations to modular forms */ Made title more descriptive

2014-02-28T01:09:41Z

Some relations to modular forms: Made title more descriptive

← Older revision		Revision as of 03:09, 28 February 2014
Line 1:		Line 1:
	~~In [[theoretical computer science]], the '''subgraph isomorphism''' problem~~ is a computational task in which two [[undirected graph\|graphs]] ''G'' and ''H'' are given as input, and one must determine whether ''G'' contains a [[Glossary of graph theory#Subgraphs\|subgraph]] that is [[graph isomorphism\|isomorphic]] to ''H''.		Jerrie Swoboda is what the individual can call me and simply I totally dig whom name. Managing people is my working day job now. As a girl what I really like is to accomplish croquet but I still can't make it my vocation really. My wife and I chose to measure in Massachusetts. Go to my web site to find out more: http://circuspartypanama.com<br><br>my homepage ... [http://circuspartypanama.com clash of clans cheats ipod]
	~~Subgraph isomorphism is a generalization of both~~ the ~~[[clique problem\|maximum clique problem]]~~ and ~~the problem of testing whether a graph contains a [[Hamiltonian cycle]], and is therefore [[NP-complete]]~~.<ref>The original {{harvtxt\|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.</ref> However certain other cases of subgraph isomorphism may be solved in polynomial time.<ref name="e99"/>

	~~Sometimes the name '''subgraph matching'''~~ is ~~also used for the same problem~~. ~~This name puts emphasis on finding such~~ a ~~subgraph as opposed to the bare decision problem.~~

	~~==Decision problem and computational complexity==~~
	~~To prove subgraph isomorphism~~ is ~~NP-complete, it must be formulated as a [[decision problem]]. The input~~ to ~~the decision problem is a pair of graphs ''G'' and ''H'~~'. ~~The answer to the problem is positive if ''H'' is isomorphic to a subgraph of ''G'',~~ and ~~negative otherwise.~~

	~~Formal question:~~

	~~Let <math>G=(V,E)</math>, <math>H=(V^\prime,E^\prime)</math> be graphs. Is there a subgraph <math>G_0=(V_0,E_0): V_0\subseteq V, E_0=E\cap(V_0\times V_0)</math> such that <math>G_0\cong H</math>?~~ I~~.e., does there exist an <math>f\colon V_0\rightarrow V^\prime</math> such that <math>(v_1,v_2)\in E_0\Leftrightarrow (f(v_1),f(v_2))\in E^\prime</math>?~~

	~~The proof of subgraph isomorphism being NP-complete is simple and based on reduction of the [[clique problem]], an NP-complete decision problem~~ in ~~which the input is a single graph ''G'' and a number ''k'', and the question is whether ''G'' contains a [[complete graph\|complete subgraph]] with ''k'' vertices~~. ~~To translate this to a subgraph isomorphism problem, simply let ''H'' be the complete graph ''K''<sub>''k''</sub>; then the answer~~ to ~~the subgraph isomorphism problem for ''G'' and ''H'' is equal~~ to the answer to the clique problem for ''G'' and ''k''. Since the clique problem is NP-complete, this [[polynomial-time many-one reduction]] shows that subgraph isomorphism is also NP-complete.<ref>{{citation\|title=Complexity Theory: ~~Exploring the Limits of Efficient Algorithms\|first=Ingo\|last=Wegener\|publisher=Springer\|year=2005\|isbn=9783540210450\|page=81\|url=~~http://~~books.google~~.com~~/books?id=1fo7_KoFUPsC&pg=PA81}}.~~<~~/ref~~>

	An alternative reduction from the [[Hamiltonian path problem\|Hamiltonian cycle]] problem translates a graph ''G'' which is to be tested for Hamiltonicity into the pair of graphs ''G'' and ''H'', where ''H'' is a cycle having the same number of vertices as ''G''. Because the Hamiltonian cycle problem is NP-complete even for [[planar graphs]], this shows that subgraph isomorphism remains NP-complete even in the planar case.<~~ref~~>~~{{citation~~
	~~\| last1 = de la Higuera \| first1 = Colin~~
	~~\| last2 = Janodet \| first2 = Jean-Christophe~~
	~~\| last3 = Samuel \| first3 = Émilie~~
	~~\| last4 = Damiand \| first4 = Guillaume~~
	~~\| last5 = Solnon \| first5 = Christine~~
	~~\| doi = 10.1016/j~~.~~tcs~~.~~2013~~.~~05.026~~
	~~\| journal = Theoretical Computer Science~~
	~~\| mr = 3083515~~
	~~\| pages = 76–99~~
	~~\| title = Polynomial algorithms for open plane graph and subgraph isomorphisms~~
	~~\| url = https://www.ibisc.univ-evry.fr/~janodet/pub/hjsds13.pdf~~
	~~\| volume = 498~~
	~~\| year = 2013~~
	\| quotation = 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.}}</ref>

	~~Subgraph isomorphism is a generalization of the~~ [[graph isomorphism problem]], which asks whether ''G'' is isomorphic to ''H'': the answer to the graph isomorphism problem is true if and only if ''G'' and ''H'' both have the same number of vertices and the subgraph isomorphism problem for ''G'' and ''H'' is true. However the complexity-theoretic status of graph isomorphism remains an open question.

	In the context of the [[Aanderaa–Karp–Rosenberg conjecture]] on the [[query complexity]] of monotone graph properties, {{harvtxt\|Gröger\|1992}} showed that any subgraph isomorphism problem has query complexity Ω(''n''<sup>3/2</sup>); that is, solving the subgraph isomorphism requires an algorithm to check the presence or absence in the input of Ω(''n''<sup>3/2</sup>) different edges in the graph.<ref>Here Ω invokes [[Big O notation\|Big Omega notation]].</ref>

	~~==Algorithms==~~
	{{harvtxt\|Ullmann\|1976}} describes a recursive backtracking procedure for solving the subgraph isomorphism problem. Although its running time is, in general, exponential, it takes polynomial time for any fixed choice of ''H'' (with a polynomial that depends on the choice of ''H''). When ''G'' is a [[planar graph]] and ''H'' is fixed, the running time of subgraph isomorphism can be reduced to [[linear time]].<ref name="e99">{{harvtxt\|Eppstein\|1999}}</ref>

	~~==Applications==~~
	As subgraph isomorphism has been applied in the area of [[cheminformatics]] to find similarities between chemical compounds from their structural formula; often in this area the term '''substructure search''' is used.<ref>{{harvtxt\|Ullmann\|1976}}</ref> Typically a [[Query language\|query structure]] is defined as [[Smiles arbitrary target specification\|SMARTS]], a [[SMILES]] extension.

	The closely related problem of counting the number of isomorphic copies of a graph ''H'' in a larger graph ''G'' has been applied to pattern discovery in databases,<ref>{{harvtxt\|Kuramochi\|Karypis\|2001}}.</ref> the [[bioinformatics]] of protein-protein interaction networks,<ref>{{harvtxt\|Pržulj\|Corneil\|Jurisica\|2006}}.</ref> and in [[exponential random graph]] methods for mathematically modeling [[social network]]s.<ref>{{harvtxt\|Snijders\|Pattison\|Robins\|Handcock\|2006}}.</ref>

	{{harvtxt\|Ohlrich\|Ebeling\|Ginting\|Sather\|1993}} describe an application of subgraph isomorphism in the [[computer-aided design]] of [[electronic circuits]]. Subgraph matching is also a substep in [[graph rewriting]] (the most runtime-intensive), and thus offered by [[Graph rewriting#Implementations and applications\|graph rewrite tools]].

	~~==See also==~~
	*[[Induced subgraph isomorphism problem]]
	*[[Maximum common subgraph isomorphism problem]]
	*[[Maximum common edge subgraph problem]]

	~~==Notes==~~
	~~{{Reflist}}~~

	~~==References==~~
	*{{Citation\|first=S. A.\|last=Cook\|authorlink=Stephen Cook\|contribution=The complexity of theorem-proving procedures\|year=1971\|title=[[Symposium on Theory of Computing\|Proc. 3rd ACM Symposium on Theory of Computing]]\|pages=151–158\|url=http://~~4mhz~~.~~de/cook.html\|doi=10.1145/800157.805047}}.~~
	*{{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}}.~~
	*{{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 = 0-7167-1045-5}}. 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\|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=0-7695-1119-8}}.
	*{{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=0-89791-577-1}}.
	*{{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}}.
	*{{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}}.
	*{{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}}.
	*{{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}}.

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

en>Michael Hardy: punctuation corrections required by WP:MOS

2013-12-22T00:09:44Z

punctuation corrections required by WP:MOS

Show changes

Deltahedron: Undid revision 509437764 by 120.56.199.116 (talk)

2012-08-27T15:23:29Z

Undid revision 509437764 by 120.56.199.116 (talk)

New page

The next step to particular game''s success is which often it produces the movie that it''s a multi player game. I experience it''s a fantasy due to the you don''t do what has necessary directly with the next player. You don''t fight and explore in unison like you would of Wow, of play to prevent another player even from the with a turn-by-turn cosmetic foundation comparable to Chess. Any time you raid another player''s village, that player is offline plus you could at this particular same time just end up raiding a random computer-generated village. 

In the event you purchasing a game to a child, appear for one allows several individuals to do together. Gaming can certainly be a singular activity. Nonetheless, it's important to guidance your youngster to be societal, and multiplayer collide of clans trucos matches can do that. They allow siblings as buddies to all park yourself and laugh and vie together. If you are getting a online game for your little one, look for one which enables numerous customers to perform with each other. Video gaming can be a solitary action. Nevertheless, it is important for you to motivate your youngster preparing to be social, and multi-player [http://circuspartypanama.com clash of clans hack] is capable performing that. They equip sisters and brothers while buddies to all among take a moment or laugh and compete with each other. Programs are fun, nonetheless could be recommended also be costly. The costs of flash games and consoles can set you back more than many people would choose those to be, but this may be eliminated. While it's true the game is a great mobile edition, it will do not lack substance as with many mobile games. So, defragging the routine registry will boost specific system overall performance for a fantastic extent. I usually get everyplace from 4000 to 5,000 m - Points within a day ($4 to $5 for Amazon. Apple showed off the dramatically anticipated i - Some of the 5 for the to start with time in San Francisco on Wednesday morning (September 12, 2012). Is actually an a huge demand when it comes to some i - Mobile device 4 application not strictly promoting business but potentially helps users to secure extra money. It [http://www.dict.cc/englisch-deutsch/appears.html appears] like computer games are everywhere we look these times. Perfect play them on your telephone, boot a the game console . in the home not to mention see them through social media on your personal computer system. It helps to comprehend this area of amusement to help a person will benefit from the numerous offers which are out. There is the helpful component of this diversion as fantastic. When one particular character has modified, the Collide of Clan Castle destroys in his or the woman village, he or she will successfully start or subscribe to for each faction to diverse gamers exactly where they can take a glance at with every other current troops to just eath other these troops could get in touch either offensively or protectively. The Clash of Clans cheat for complimentary additionally holds the highest district centered globally converse so gamers could laps making use of other players for social courting and as faction applying.This recreation is a have to perform on your android hardware specially if you are employing my clash created by clans android hack product.

← Older revision		Revision as of 03:09, 28 February 2014
Line 1:		Line 1:
	~~In [[theoretical computer science]], the '''subgraph isomorphism''' problem~~ is a computational task in which two [[undirected graph\|graphs]] ''G'' and ''H'' are given as input, and one must determine whether ''G'' contains a [[Glossary of graph theory#Subgraphs\|subgraph]] that is [[graph isomorphism\|isomorphic]] to ''H''.		Jerrie Swoboda is what the individual can call me and simply I totally dig whom name. Managing people is my working day job now. As a girl what I really like is to accomplish croquet but I still can't make it my vocation really. My wife and I chose to measure in Massachusetts. Go to my web site to find out more: http://circuspartypanama.com<br><br>my homepage ... [http://circuspartypanama.com clash of clans cheats ipod]
	~~Subgraph isomorphism is a generalization of both~~ the ~~[[clique problem\|maximum clique problem]]~~ and ~~the problem of testing whether a graph contains a [[Hamiltonian cycle]], and is therefore [[NP-complete]]~~.<ref>The original {{harvtxt\|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.</ref> However certain other cases of subgraph isomorphism may be solved in polynomial time.<ref name="e99"/>

	~~Sometimes the name '''subgraph matching'''~~ is ~~also used for the same problem~~. ~~This name puts emphasis on finding such~~ a ~~subgraph as opposed to the bare decision problem.~~

	~~==Decision problem and computational complexity==~~
	~~To prove subgraph isomorphism~~ is ~~NP-complete, it must be formulated as a [[decision problem]]. The input~~ to ~~the decision problem is a pair of graphs ''G'' and ''H'~~'. ~~The answer to the problem is positive if ''H'' is isomorphic to a subgraph of ''G'',~~ and ~~negative otherwise.~~

	~~Formal question:~~

	~~Let <math>G=(V,E)</math>, <math>H=(V^\prime,E^\prime)</math> be graphs. Is there a subgraph <math>G_0=(V_0,E_0): V_0\subseteq V, E_0=E\cap(V_0\times V_0)</math> such that <math>G_0\cong H</math>?~~ I~~.e., does there exist an <math>f\colon V_0\rightarrow V^\prime</math> such that <math>(v_1,v_2)\in E_0\Leftrightarrow (f(v_1),f(v_2))\in E^\prime</math>?~~

	~~The proof of subgraph isomorphism being NP-complete is simple and based on reduction of the [[clique problem]], an NP-complete decision problem~~ in ~~which the input is a single graph ''G'' and a number ''k'', and the question is whether ''G'' contains a [[complete graph\|complete subgraph]] with ''k'' vertices~~. ~~To translate this to a subgraph isomorphism problem, simply let ''H'' be the complete graph ''K''<sub>''k''</sub>; then the answer~~ to ~~the subgraph isomorphism problem for ''G'' and ''H'' is equal~~ to the answer to the clique problem for ''G'' and ''k''. Since the clique problem is NP-complete, this [[polynomial-time many-one reduction]] shows that subgraph isomorphism is also NP-complete.<ref>{{citation\|title=Complexity Theory: ~~Exploring the Limits of Efficient Algorithms\|first=Ingo\|last=Wegener\|publisher=Springer\|year=2005\|isbn=9783540210450\|page=81\|url=~~http://~~books.google~~.com~~/books?id=1fo7_KoFUPsC&pg=PA81}}.~~<~~/ref~~>

	An alternative reduction from the [[Hamiltonian path problem\|Hamiltonian cycle]] problem translates a graph ''G'' which is to be tested for Hamiltonicity into the pair of graphs ''G'' and ''H'', where ''H'' is a cycle having the same number of vertices as ''G''. Because the Hamiltonian cycle problem is NP-complete even for [[planar graphs]], this shows that subgraph isomorphism remains NP-complete even in the planar case.<~~ref~~>~~{{citation~~
	~~\| last1 = de la Higuera \| first1 = Colin~~
	~~\| last2 = Janodet \| first2 = Jean-Christophe~~
	~~\| last3 = Samuel \| first3 = Émilie~~
	~~\| last4 = Damiand \| first4 = Guillaume~~
	~~\| last5 = Solnon \| first5 = Christine~~
	~~\| doi = 10.1016/j~~.~~tcs~~.~~2013~~.~~05.026~~
	~~\| journal = Theoretical Computer Science~~
	~~\| mr = 3083515~~
	~~\| pages = 76–99~~
	~~\| title = Polynomial algorithms for open plane graph and subgraph isomorphisms~~
	~~\| url = https://www.ibisc.univ-evry.fr/~janodet/pub/hjsds13.pdf~~
	~~\| volume = 498~~
	~~\| year = 2013~~
	\| quotation = 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.}}</ref>

	~~Subgraph isomorphism is a generalization of the~~ [[graph isomorphism problem]], which asks whether ''G'' is isomorphic to ''H'': the answer to the graph isomorphism problem is true if and only if ''G'' and ''H'' both have the same number of vertices and the subgraph isomorphism problem for ''G'' and ''H'' is true. However the complexity-theoretic status of graph isomorphism remains an open question.

	In the context of the [[Aanderaa–Karp–Rosenberg conjecture]] on the [[query complexity]] of monotone graph properties, {{harvtxt\|Gröger\|1992}} showed that any subgraph isomorphism problem has query complexity Ω(''n''<sup>3/2</sup>); that is, solving the subgraph isomorphism requires an algorithm to check the presence or absence in the input of Ω(''n''<sup>3/2</sup>) different edges in the graph.<ref>Here Ω invokes [[Big O notation\|Big Omega notation]].</ref>

	~~==Algorithms==~~
	{{harvtxt\|Ullmann\|1976}} describes a recursive backtracking procedure for solving the subgraph isomorphism problem. Although its running time is, in general, exponential, it takes polynomial time for any fixed choice of ''H'' (with a polynomial that depends on the choice of ''H''). When ''G'' is a [[planar graph]] and ''H'' is fixed, the running time of subgraph isomorphism can be reduced to [[linear time]].<ref name="e99">{{harvtxt\|Eppstein\|1999}}</ref>

	~~==Applications==~~
	As subgraph isomorphism has been applied in the area of [[cheminformatics]] to find similarities between chemical compounds from their structural formula; often in this area the term '''substructure search''' is used.<ref>{{harvtxt\|Ullmann\|1976}}</ref> Typically a [[Query language\|query structure]] is defined as [[Smiles arbitrary target specification\|SMARTS]], a [[SMILES]] extension.

	The closely related problem of counting the number of isomorphic copies of a graph ''H'' in a larger graph ''G'' has been applied to pattern discovery in databases,<ref>{{harvtxt\|Kuramochi\|Karypis\|2001}}.</ref> the [[bioinformatics]] of protein-protein interaction networks,<ref>{{harvtxt\|Pržulj\|Corneil\|Jurisica\|2006}}.</ref> and in [[exponential random graph]] methods for mathematically modeling [[social network]]s.<ref>{{harvtxt\|Snijders\|Pattison\|Robins\|Handcock\|2006}}.</ref>

	{{harvtxt\|Ohlrich\|Ebeling\|Ginting\|Sather\|1993}} describe an application of subgraph isomorphism in the [[computer-aided design]] of [[electronic circuits]]. Subgraph matching is also a substep in [[graph rewriting]] (the most runtime-intensive), and thus offered by [[Graph rewriting#Implementations and applications\|graph rewrite tools]].

	~~==See also==~~
	*[[Induced subgraph isomorphism problem]]
	*[[Maximum common subgraph isomorphism problem]]
	*[[Maximum common edge subgraph problem]]

	~~==Notes==~~
	~~{{Reflist}}~~

	~~==References==~~
	*{{Citation\|first=S. A.\|last=Cook\|authorlink=Stephen Cook\|contribution=The complexity of theorem-proving procedures\|year=1971\|title=[[Symposium on Theory of Computing\|Proc. 3rd ACM Symposium on Theory of Computing]]\|pages=151–158\|url=http://~~4mhz~~.~~de/cook.html\|doi=10.1145/800157.805047}}.~~
	*{{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}}.~~
	*{{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 = 0-7167-1045-5}}. 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\|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=0-7695-1119-8}}.
	*{{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=0-89791-577-1}}.
	*{{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}}.
	*{{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}}.
	*{{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}}.
	*{{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}}.

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