Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Tree-depth> ?p ?o. }
Showing items 1 to 18 of
18
with 100 items per page.
- Tree-depth abstract "In graph theory, the tree-depth of a connected undirected graph G is a numerical invariant of G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different names in the literature, including vertex ranking number, ordered chromatic number, and minimum elimination tree height; it is also closely related to the cycle rank of directed graphs and the star height of regular languages. Intuitively, where the treewidth graph width parameter measures how far a graph is from being a tree, this parameter measures how far a graph is from being a star.".
- Tree-depth thumbnail Tree-depth.svg?width=300.
- Tree-depth wikiPageExternalLink 1995-03.pdf.
- Tree-depth wikiPageExternalLink icalp08.pdf.
- Tree-depth wikiPageID "25768005".
- Tree-depth wikiPageRevisionID "592505172".
- Tree-depth hasPhotoCollection Tree-depth.
- Tree-depth subject Category:Graph_coloring.
- Tree-depth subject Category:Graph_invariants.
- Tree-depth subject Category:Graph_minor_theory.
- Tree-depth comment "In graph theory, the tree-depth of a connected undirected graph G is a numerical invariant of G, the minimum height of a Trémaux tree for a supergraph of G. This invariant and its close relatives have gone under many different names in the literature, including vertex ranking number, ordered chromatic number, and minimum elimination tree height; it is also closely related to the cycle rank of directed graphs and the star height of regular languages.".
- Tree-depth label "Tree-depth".
- Tree-depth sameAs m.0kmpjr0.
- Tree-depth sameAs Q7837500.
- Tree-depth sameAs Q7837500.
- Tree-depth wasDerivedFrom Tree-depth?oldid=592505172.
- Tree-depth depiction Tree-depth.svg.
- Tree-depth isPrimaryTopicOf Tree-depth.
