subgraph
Look at other dictionaries:
Subgraph — Bei der Untersuchung von Grapheneigenschaften schließt man häufiger von lokalen auf globale Eigenschaften von Graphen und umgekehrt. Um derartige Vorgänge besser beschreiben zu können, definiert man geeignete Relationen zwischen Graphen und… … Deutsch Wikipedia
Subgraph isomorphism problem — In complexity theory, Subgraph Isomorphism is a decision problem that is known to be NP complete. The formal description of the decision problem is as follows.Subgraph Isomorphism(G1, G2) Input: Two graphs G1 and G2. Question: Is G1 isomorphic to … Wikipedia
subgraph — noun Date: 1931 a graph all of whose points and lines are contained in a larger graph … New Collegiate Dictionary
subgraph — sub·graph … English syllables
subgraph — ˈsəbˌˌ noun Etymology: sub + graph : a graph all of whose points and lines are contained in a larger graph … Useful english dictionary
Dense subgraph — An example of a graph G with density dG = 1.375 and it s densest subgraph induced by the vertices b,c,d and h in red with density 1.4 In computer science the notion of highly connect … Wikipedia
Induced subgraph isomorphism problem — In complexity theory and graph theory, induced subgraph isomorphism is an NP complete decision problem that involves finding a given graph as an induced subgraph of a larger graph.Formally, the problem takes as input two graphs G 1=( V 1, E 1)… … Wikipedia
Maximum common subgraph isomorphism problem — In complexity theory, maximum common subgraph isomorphism (MCS) is an optimization problem that is known to be NP hard. The formal description of the problem is as follows: Maximum common subgraph isomorphism(G1, G2) Input: Two graphs G1 and G2.… … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
