K-graph C*-algebra: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
Newer edit →
en>BattyBot
merged templates into Template:Multiple issues & general fixes using AWB (8207)
 
en>Ronica Bagwandin
No edit summary
Line 1: Line 1:
Roberto Ebbert is what his wife loves to call him and his wife doesn't like it at all. His job is a payroll clerk. It's not a common thing but what he likes doing is to [http://www.Answers.com/topic/model+trains model trains] and he'll be starting something else along with it. [http://imageshack.us/photos/Virginia Virginia] is where he's been living for years. He's been working on his website for some time now. Check it out here: http://brockjefferson.wordpress.com/<br><br>Here is my weblog ... comprar new balance baratas ([http://brockjefferson.wordpress.com/ http://brockjefferson.wordpress.com/])
Given two [[graph (mathematics)|graph]]s <math>G</math> and <math>G'</math>, the '''maximum common edge subgraph problem''' is the problem of finding a graph <math>H</math> with a maximal number of edges which is [[graph isomorphism|isomorphic]] to a [[Glossary_of_graph_theory#Subgraphs|subgraph]] of <math>G</math> and a subgraph of <math>G'</math>.
 
The maximum common edge subgraph problem on general graphs is [[NP-complete]] as it is a generalization of [[subgraph isomorphism]]. Unless <math>G</math> and <math>G'</math> are required to have the same number of vertices, the problem is [[APX-hard]].<ref>L. Bahiense, G. Manic, B. Piva, C.C. de Souza. The maximum common edge subgraph problem: A polyhedral investigation. Discrete Applied Mathematics, 160(18):2523-2541, 2012. http://dx.doi.org/10.1016/j.dam.2012.01.026</ref>
 
== See also ==
 
*[[Maximum common subgraph isomorphism problem]]
*[[Subgraph isomorphism problem]]
*[[Induced subgraph isomorphism problem]]
 
== References ==
<references />
 
[[Category:Graph theory]]
 
 
{{algorithm-stub}}

Revision as of 19:11, 26 November 2013

Given two graphs and , the maximum common edge subgraph problem is the problem of finding a graph with a maximal number of edges which is isomorphic to a subgraph of and a subgraph of .

The maximum common edge subgraph problem on general graphs is NP-complete as it is a generalization of subgraph isomorphism. Unless and are required to have the same number of vertices, the problem is APX-hard.[1]

See also

References

  1. ↑ L. Bahiense, G. Manic, B. Piva, C.C. de Souza. The maximum common edge subgraph problem: A polyhedral investigation. Discrete Applied Mathematics, 160(18):2523-2541, 2012. http://dx.doi.org/10.1016/j.dam.2012.01.026


Template:Algorithm-stub

Retrieved from "https://en.formulasearchengine.com/index.php?title=K-graph_C*-algebra&oldid=27856"