Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q11246292> ?p ?o }
Showing triples 1 to 48 of
48
with 100 triples per page.
- Q11246292 subject Q13279854.
- Q11246292 subject Q8432158.
- Q11246292 subject Q8612141.
- Q11246292 abstract "In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Two fundamental questions about a signed graph are: Is it balanced? What is the largest size of a balanced edge set in it? The first question is not difficult; the second is computationally intractable (technically, it is NP-hard).Signed graphs appeared with the balance theory advanced by Fritz Heider with triangles of sentiments. At the Center for Group Dynamics at University of Michigan, Dorwin Cartwright and Frank Harary adapted the approach to a theory of balanced graphs.Signed graphs have been rediscovered many times because they come up naturally in many unrelated areas. For instance, they enable one to describe and analyze the geometry of subsets of the classical root systems. They appear in topological graph theory and group theory. They are a natural context for questions about odd and even cycles in graphs. They appear in computing the ground state energy in the non-ferromagnetic Ising model; for this one needs to find a largest balanced edge set in Σ. They have been applied to data classification in correlation clustering.".
- Q11246292 thumbnail Pox.jpg?width=300.
- Q11246292 wikiPageWikiLink Q1057968.
- Q11246292 wikiPageWikiLink Q1076349.
- Q11246292 wikiPageWikiLink Q1087609.
- Q11246292 wikiPageWikiLink Q112202.
- Q11246292 wikiPageWikiLink Q1137554.
- Q11246292 wikiPageWikiLink Q1137726.
- Q11246292 wikiPageWikiLink Q131476.
- Q11246292 wikiPageWikiLink Q13279854.
- Q11246292 wikiPageWikiLink Q141488.
- Q11246292 wikiPageWikiLink Q1443394.
- Q11246292 wikiPageWikiLink Q1490646.
- Q11246292 wikiPageWikiLink Q161272.
- Q11246292 wikiPageWikiLink Q166507.
- Q11246292 wikiPageWikiLink Q174733.
- Q11246292 wikiPageWikiLink Q189112.
- Q11246292 wikiPageWikiLink Q230492.
- Q11246292 wikiPageWikiLink Q245595.
- Q11246292 wikiPageWikiLink Q304922.
- Q11246292 wikiPageWikiLink Q338432.
- Q11246292 wikiPageWikiLink Q361.
- Q11246292 wikiPageWikiLink Q395.
- Q11246292 wikiPageWikiLink Q4115842.
- Q11246292 wikiPageWikiLink Q44337.
- Q11246292 wikiPageWikiLink Q445546.
- Q11246292 wikiPageWikiLink Q4480008.
- Q11246292 wikiPageWikiLink Q4902585.
- Q11246292 wikiPageWikiLink Q4904180.
- Q11246292 wikiPageWikiLink Q504843.
- Q11246292 wikiPageWikiLink Q5149043.
- Q11246292 wikiPageWikiLink Q5172845.
- Q11246292 wikiPageWikiLink Q534131.
- Q11246292 wikiPageWikiLink Q5517214.
- Q11246292 wikiPageWikiLink Q727035.
- Q11246292 wikiPageWikiLink Q7858715.
- Q11246292 wikiPageWikiLink Q8432158.
- Q11246292 wikiPageWikiLink Q849798.
- Q11246292 wikiPageWikiLink Q8612141.
- Q11246292 wikiPageWikiLink Q874429.
- Q11246292 wikiPageWikiLink Q898572.
- Q11246292 wikiPageWikiLink Q942557.
- Q11246292 comment "In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Two fundamental questions about a signed graph are: Is it balanced? What is the largest size of a balanced edge set in it? The first question is not difficult; the second is computationally intractable (technically, it is NP-hard).Signed graphs appeared with the balance theory advanced by Fritz Heider with triangles of sentiments.".
- Q11246292 label "Signed graph".
- Q11246292 depiction Pox.jpg.
