Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3115592> ?p ?o }
Showing triples 1 to 96 of
96
with 100 triples per page.
- Q3115592 subject Q6362678.
- Q3115592 subject Q7217193.
- Q3115592 subject Q7452136.
- Q3115592 subject Q8480477.
- Q3115592 abstract "In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between each pair of a, b, and c.The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them "median graphs" appears to be Nebeský (1971). As Chung, Graham, and Saks write, "median graphs arise naturally in the study of ordered sets and discrete distributive lattices, and have an extensive literature". In phylogenetics, the Buneman graph representing all maximum parsimony evolutionary trees is a median graph. Median graphs also arise in social choice theory: if a set of alternatives has the structure of a median graph, it is possible to derive in an unambiguous way a majority preference among them.Additional surveys of median graphs are given by Klavžar & Mulder (1999), Bandelt & Chepoi (2008), and Knuth (2008).".
- Q3115592 thumbnail Median_graph.svg?width=300.
- Q3115592 wikiPageExternalLink citation.cfm?id=545381.545427.
- Q3115592 wikiPageExternalLink survey_cm_bis.pdf.
- Q3115592 wikiPageExternalLink 98dynamicsearch.pdf.
- Q3115592 wikiPageExternalLink 37.
- Q3115592 wikiPageExternalLink 1183510977.
- Q3115592 wikiPageExternalLink phylomurka.
- Q3115592 wikiPageExternalLink sharenet.htm.
- Q3115592 wikiPageExternalLink 743.
- Q3115592 wikiPageExternalLink gc_211.html.
- Q3115592 wikiPageExternalLink 101location.pdf.
- Q3115592 wikiPageWikiLink Q1053304.
- Q3115592 wikiPageWikiLink Q1058754.
- Q3115592 wikiPageWikiLink Q1137726.
- Q3115592 wikiPageWikiLink Q1144819.
- Q3115592 wikiPageWikiLink Q1252145.
- Q3115592 wikiPageWikiLink Q1304193.
- Q3115592 wikiPageWikiLink Q131476.
- Q3115592 wikiPageWikiLink Q141488.
- Q3115592 wikiPageWikiLink Q1524945.
- Q3115592 wikiPageWikiLink Q1603101.
- Q3115592 wikiPageWikiLink Q1651704.
- Q3115592 wikiPageWikiLink Q165474.
- Q3115592 wikiPageWikiLink Q166507.
- Q3115592 wikiPageWikiLink Q171184.
- Q3115592 wikiPageWikiLink Q1764144.
- Q3115592 wikiPageWikiLink Q177251.
- Q3115592 wikiPageWikiLink Q1805805.
- Q3115592 wikiPageWikiLink Q185521.
- Q3115592 wikiPageWikiLink Q185813.
- Q3115592 wikiPageWikiLink Q187959.
- Q3115592 wikiPageWikiLink Q191081.
- Q3115592 wikiPageWikiLink Q1971461.
- Q3115592 wikiPageWikiLink Q1992074.
- Q3115592 wikiPageWikiLink Q226995.
- Q3115592 wikiPageWikiLink Q2303305.
- Q3115592 wikiPageWikiLink Q2363730.
- Q3115592 wikiPageWikiLink Q242125.
- Q3115592 wikiPageWikiLink Q242767.
- Q3115592 wikiPageWikiLink Q2713824.
- Q3115592 wikiPageWikiLink Q272404.
- Q3115592 wikiPageWikiLink Q272735.
- Q3115592 wikiPageWikiLink Q2742711.
- Q3115592 wikiPageWikiLink Q3142246.
- Q3115592 wikiPageWikiLink Q325904.
- Q3115592 wikiPageWikiLink Q3385162.
- Q3115592 wikiPageWikiLink Q3406706.
- Q3115592 wikiPageWikiLink Q368988.
- Q3115592 wikiPageWikiLink Q383444.
- Q3115592 wikiPageWikiLink Q395.
- Q3115592 wikiPageWikiLink Q40231.
- Q3115592 wikiPageWikiLink Q450226.
- Q3115592 wikiPageWikiLink Q4596967.
- Q3115592 wikiPageWikiLink Q4720939.
- Q3115592 wikiPageWikiLink Q5166521.
- Q3115592 wikiPageWikiLink Q5179263.
- Q3115592 wikiPageWikiLink Q520777.
- Q3115592 wikiPageWikiLink Q5282038.
- Q3115592 wikiPageWikiLink Q538846.
- Q3115592 wikiPageWikiLink Q5412712.
- Q3115592 wikiPageWikiLink Q5535496.
- Q3115592 wikiPageWikiLink Q595364.
- Q3115592 wikiPageWikiLink Q622506.
- Q3115592 wikiPageWikiLink Q6362678.
- Q3115592 wikiPageWikiLink Q644719.
- Q3115592 wikiPageWikiLink Q6497118.
- Q3115592 wikiPageWikiLink Q6674930.
- Q3115592 wikiPageWikiLink Q6806108.
- Q3115592 wikiPageWikiLink Q712620.
- Q3115592 wikiPageWikiLink Q7140363.
- Q3115592 wikiPageWikiLink Q7168092.
- Q3115592 wikiPageWikiLink Q7217193.
- Q3115592 wikiPageWikiLink Q739462.
- Q3115592 wikiPageWikiLink Q739925.
- Q3115592 wikiPageWikiLink Q7432.
- Q3115592 wikiPageWikiLink Q7452136.
- Q3115592 wikiPageWikiLink Q7520883.
- Q3115592 wikiPageWikiLink Q7582090.
- Q3115592 wikiPageWikiLink Q761631.
- Q3115592 wikiPageWikiLink Q7840044.
- Q3115592 wikiPageWikiLink Q82438.
- Q3115592 wikiPageWikiLink Q826467.
- Q3115592 wikiPageWikiLink Q831304.
- Q3115592 wikiPageWikiLink Q846564.
- Q3115592 wikiPageWikiLink Q8480477.
- Q3115592 wikiPageWikiLink Q852973.
- Q3115592 wikiPageWikiLink Q901446.
- Q3115592 wikiPageWikiLink Q958394.
- Q3115592 comment "In graph theory, a division of mathematics, a median graph is an undirected graph in which every three vertices a, b, and c have a unique median: a vertex m(a,b,c) that belongs to shortest paths between each pair of a, b, and c.The concept of median graphs has long been studied, for instance by Birkhoff & Kiss (1947) or (more explicitly) by Avann (1961), but the first paper to call them "median graphs" appears to be Nebeský (1971).".
- Q3115592 label "Median graph".
- Q3115592 depiction Median_graph.svg.