| http://dbpedia.org/ontology/abstract
|
Некорневое двоичное дерево — это некорневое дерево, в котором каждая вершина имеет либо одного, либо трёх соседей.
, Некореневе двійкове дерево — це некореневе дерево, в якому кожна вершина має одного або трьох сусідів.
, In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/TreeActinobacteria.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.combinatorics.org/Volume_3/PDFFiles/v3i1r30.pdf +
, http://infoscience.epfl.ch/record/97874/files/jalgs.pdf +
, http://www.cs.uga.edu/~rwr/publications/binary.pdf +
|
| http://dbpedia.org/ontology/wikiPageID
|
27950476
|
| http://dbpedia.org/ontology/wikiPageLength
|
14319
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1081059657
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Planar_graph +
, http://dbpedia.org/resource/Connected_graph +
, http://dbpedia.org/resource/Degree_%28graph_theory%29 +
, http://dbpedia.org/resource/Ordered_tree +
, http://dbpedia.org/resource/Kraft%E2%80%93McMillan_inequality +
, http://dbpedia.org/resource/Branch-decomposition +
, http://dbpedia.org/resource/Maximal_element +
, http://dbpedia.org/resource/Hierarchical_clustering +
, http://dbpedia.org/resource/Ternary_tree +
, http://dbpedia.org/resource/Data_structure +
, http://dbpedia.org/resource/Graph_enumeration +
, http://dbpedia.org/resource/Treewidth +
, http://dbpedia.org/resource/Family_of_sets +
, http://dbpedia.org/resource/Cycle_%28graph_theory%29 +
, http://dbpedia.org/resource/Double_factorial +
, http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
, http://dbpedia.org/resource/Theory_of_evolution +
, http://dbpedia.org/resource/Common_ancestor +
, http://dbpedia.org/resource/File:An_example_of_an_unrooted_binary_tree_with_four_leaves.pdf +
, http://dbpedia.org/resource/Maximum_parsimony +
, http://dbpedia.org/resource/File:TreeActinobacteria.svg +
, http://dbpedia.org/resource/Cladistics +
, http://dbpedia.org/resource/Undirected_graph +
, http://dbpedia.org/resource/Phylogenetic_tree +
, http://dbpedia.org/resource/Binary_tree +
, http://dbpedia.org/resource/Raffaele_Pesenti +
, http://dbpedia.org/resource/Laurence_Wolsey +
, http://dbpedia.org/resource/Dynamic_programming +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Evolutionary_tree +
, http://dbpedia.org/resource/Free_tree +
, http://dbpedia.org/resource/Quartet_distance +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Citation +
, http://dbpedia.org/resource/Template:Reflist +
, http://dbpedia.org/resource/Template:Main +
, http://dbpedia.org/resource/Template:OEIS +
, http://dbpedia.org/resource/Template:Cite_arXiv +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Trees_%28graph_theory%29 +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Tree +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Unrooted_binary_tree?oldid=1081059657&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/TreeActinobacteria.svg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Unrooted_binary_tree +
|
| owl:sameAs |
http://ru.dbpedia.org/resource/%D0%9D%D0%B5%D0%BA%D0%BE%D1%80%D0%BD%D0%B5%D0%B2%D0%BE%D0%B5_%D0%B4%D0%B2%D0%BE%D0%B8%D1%87%D0%BD%D0%BE%D0%B5_%D0%B4%D0%B5%D1%80%D0%B5%D0%B2%D0%BE +
, http://www.wikidata.org/entity/Q7897401 +
, http://dbpedia.org/resource/Unrooted_binary_tree +
, http://uk.dbpedia.org/resource/%D0%9D%D0%B5%D0%BA%D0%BE%D1%80%D0%B5%D0%BD%D0%B5%D0%B2%D0%B5_%D0%B4%D0%B2%D1%96%D0%B9%D0%BA%D0%BE%D0%B2%D0%B5_%D0%B4%D0%B5%D1%80%D0%B5%D0%B2%D0%BE +
, https://global.dbpedia.org/id/4wjZx +
, http://rdf.freebase.com/ns/m.0ch30s6 +
|
| rdf:type |
http://dbpedia.org/ontology/Plant +
|
| rdfs:comment |
In mathematics and computer science, an unrooted binary tree is an unrooted tree in which each vertex has either one or three neighbors.
, Некорневое двоичное дерево — это некорневое дерево, в котором каждая вершина имеет либо одного, либо трёх соседей.
, Некореневе двійкове дерево — це некореневе дерево, в якому кожна вершина має одного або трьох сусідів.
|
| rdfs:label |
Некорневое двоичное дерево
, Некореневе двійкове дерево
, Unrooted binary tree
|
