Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hypertree> ?p ?o. }
Showing items 1 to 15 of
15
with 100 items per page.
- Hypertree abstract "A hypergraph H is called a hypertree, if it admits a host graph T such that T is a tree, in other words if there exists a tree T such that every hyperedge of H induces a subtree in T. Since a tree is a hypertree, hypertrees may be seen as a generalization of the notion of a tree for hypergraphs. Any hypertree is isomorphic to some family of subtrees of a tree.".
- Hypertree wikiPageID "19716804".
- Hypertree wikiPageRevisionID "545462025".
- Hypertree hasPhotoCollection Hypertree.
- Hypertree subject Category:Hypergraphs.
- Hypertree subject Category:Trees_(data_structures).
- Hypertree comment "A hypergraph H is called a hypertree, if it admits a host graph T such that T is a tree, in other words if there exists a tree T such that every hyperedge of H induces a subtree in T. Since a tree is a hypertree, hypertrees may be seen as a generalization of the notion of a tree for hypergraphs. Any hypertree is isomorphic to some family of subtrees of a tree.".
- Hypertree label "Hiperárbol".
- Hypertree label "Hypertree".
- Hypertree sameAs Hiperárbol.
- Hypertree sameAs m.04n2f1x.
- Hypertree sameAs Q5958769.
- Hypertree sameAs Q5958769.
- Hypertree wasDerivedFrom Hypertree?oldid=545462025.
- Hypertree isPrimaryTopicOf Hypertree.