Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tournament_(graph_theory)> ?p ?o. }
Showing items 1 to 35 of
35
with 100 items per page.
- Tournament_(graph_theory) abstract "A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of vertices is connected by a single directed edge.Many of the important properties of tournaments were first investigated by Landau in order to model dominance relations in flocks of chickens. Current applications of tournaments include the study of voting theory and social choice theory among other things. The name tournament originates from such a graph's interpretation as the outcome of a round-robin tournament in which every player encounters every other player exactly once, and in which no draws occur. In the tournament digraph, the vertices correspond to the players. The edge between each pair of players is oriented from the winner to the loser. If player beats player , then it is said that dominates .".
- Tournament_(graph_theory) thumbnail 4-tournament.svg?width=300.
- Tournament_(graph_theory) wikiPageExternalLink p297.
- Tournament_(graph_theory) wikiPageExternalLink 1963-08.pdf.
- Tournament_(graph_theory) wikiPageExternalLink 1964-22.pdf.
- Tournament_(graph_theory) wikiPageID "1427502".
- Tournament_(graph_theory) wikiPageRevisionID "603777746".
- Tournament_(graph_theory) hasPhotoCollection Tournament_(graph_theory).
- Tournament_(graph_theory) id "3518".
- Tournament_(graph_theory) imageCaption "A tournament on 4 vertices".
- Tournament_(graph_theory) name "Tournament".
- Tournament_(graph_theory) title "tournament".
- Tournament_(graph_theory) subject Category:Directed_graphs.
- Tournament_(graph_theory) type Abstraction100002137.
- Tournament_(graph_theory) type Communication100033020.
- Tournament_(graph_theory) type DirectedGraphs.
- Tournament_(graph_theory) type Graph107000195.
- Tournament_(graph_theory) type VisualCommunication106873252.
- Tournament_(graph_theory) comment "A tournament is a directed graph (digraph) obtained by assigning a direction for each edge in an undirected complete graph. That is, it is an orientation of a complete graph, or equivalently a directed graph in which every pair of vertices is connected by a single directed edge.Many of the important properties of tournaments were first investigated by Landau in order to model dominance relations in flocks of chickens.".
- Tournament_(graph_theory) label "Tournament (graph theory)".
- Tournament_(graph_theory) label "Tournoi (graphe)".
- Tournament_(graph_theory) label "Turniej (matematyka)".
- Tournament_(graph_theory) label "Turniergraph".
- Tournament_(graph_theory) label "Турнир (теория графов)".
- Tournament_(graph_theory) sameAs Turniergraph.
- Tournament_(graph_theory) sameAs Tournoi_(graphe).
- Tournament_(graph_theory) sameAs Toernooigraaf.
- Tournament_(graph_theory) sameAs Turniej_(matematyka).
- Tournament_(graph_theory) sameAs m.050pjt.
- Tournament_(graph_theory) sameAs Q1320634.
- Tournament_(graph_theory) sameAs Q1320634.
- Tournament_(graph_theory) sameAs Tournament_(graph_theory).
- Tournament_(graph_theory) wasDerivedFrom Tournament_(graph_theory)?oldid=603777746.
- Tournament_(graph_theory) depiction 4-tournament.svg.
- Tournament_(graph_theory) isPrimaryTopicOf Tournament_(graph_theory).
