Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Tree-depth> ?p ?o }
Showing triples 1 to 92 of
92
with 100 triples 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 wikiPageLength "18260".
- Tree-depth wikiPageOutDegree "65".
- Tree-depth wikiPageRevisionID "682312263".
- Tree-depth wikiPageWikiLink Approximation_algorithm.
- Tree-depth wikiPageWikiLink Binary_search.
- Tree-depth wikiPageWikiLink Binary_search_algorithm.
- Tree-depth wikiPageWikiLink Bipartite_graph.
- Tree-depth wikiPageWikiLink Category:Graph_coloring.
- Tree-depth wikiPageWikiLink Category:Graph_invariants.
- Tree-depth wikiPageWikiLink Category:Graph_minor_theory.
- Tree-depth wikiPageWikiLink Chordal_graph.
- Tree-depth wikiPageWikiLink Clique_(graph_theory).
- Tree-depth wikiPageWikiLink Complement_(graph_theory).
- Tree-depth wikiPageWikiLink Complement_graph.
- Tree-depth wikiPageWikiLink Complete_bipartite_graph.
- Tree-depth wikiPageWikiLink Complete_graph.
- Tree-depth wikiPageWikiLink Connected_graph.
- Tree-depth wikiPageWikiLink Connectivity_(graph_theory).
- Tree-depth wikiPageWikiLink Cycle_rank.
- Tree-depth wikiPageWikiLink Degeneracy_(graph_theory).
- Tree-depth wikiPageWikiLink Directed_graph.
- Tree-depth wikiPageWikiLink Dynamic_programming.
- Tree-depth wikiPageWikiLink Forbidden_graph_characterization.
- Tree-depth wikiPageWikiLink Forest_(graph_theory).
- Tree-depth wikiPageWikiLink Glossary_of_graph_theory.
- Tree-depth wikiPageWikiLink Graph_(mathematics).
- Tree-depth wikiPageWikiLink Graph_coloring.
- Tree-depth wikiPageWikiLink Graph_invariant.
- Tree-depth wikiPageWikiLink Graph_minor.
- Tree-depth wikiPageWikiLink Graph_property.
- Tree-depth wikiPageWikiLink Graph_theory.
- Tree-depth wikiPageWikiLink Halin_graph.
- Tree-depth wikiPageWikiLink Higmans_lemma.
- Tree-depth wikiPageWikiLink Induced_subgraph.
- Tree-depth wikiPageWikiLink Information_Processing_Letters.
- Tree-depth wikiPageWikiLink International_Colloquium_on_Automata,_Languages_and_Programming.
- Tree-depth wikiPageWikiLink International_Symposium_on_Fundamentals_of_Computation_Theory.
- Tree-depth wikiPageWikiLink Journal_of_the_ACM.
- Tree-depth wikiPageWikiLink Minor_(graph_theory).
- Tree-depth wikiPageWikiLink NP-complete.
- Tree-depth wikiPageWikiLink NP-completeness.
- Tree-depth wikiPageWikiLink Outerplanar_graph.
- Tree-depth wikiPageWikiLink Parameterized_complexity.
- Tree-depth wikiPageWikiLink Path_graph.
- Tree-depth wikiPageWikiLink Pathwidth.
- Tree-depth wikiPageWikiLink Pebble_game.
- Tree-depth wikiPageWikiLink Pennsylvania_State_University.
- Tree-depth wikiPageWikiLink Polynomial_time.
- Tree-depth wikiPageWikiLink Pursuit-evasion.
- Tree-depth wikiPageWikiLink Regular_language.
- Tree-depth wikiPageWikiLink Robertson–Seymour_theorem.
- Tree-depth wikiPageWikiLink SIAM_Journal_on_Discrete_Mathematics.
- Tree-depth wikiPageWikiLink Series-parallel_graph.
- Tree-depth wikiPageWikiLink Star_(graph_theory).
- Tree-depth wikiPageWikiLink Star_height.
- Tree-depth wikiPageWikiLink Time_complexity.
- Tree-depth wikiPageWikiLink Tree_(graph_theory).
- Tree-depth wikiPageWikiLink Tree_decomposition.
- Tree-depth wikiPageWikiLink Treewidth.
- Tree-depth wikiPageWikiLink Trivially_perfect_graph.
- Tree-depth wikiPageWikiLink Trémaux_tree.
- Tree-depth wikiPageWikiLink Undirected_graph.
- Tree-depth wikiPageWikiLink Well-quasi-ordering.
- Tree-depth wikiPageWikiLink File:Tree-depth.svg.
- Tree-depth wikiPageWikiLinkText "Centered coloring".
- Tree-depth wikiPageWikiLinkText "Tree-depth".
- Tree-depth wikiPageWikiLinkText "tree-depth".
- Tree-depth hasPhotoCollection Tree-depth.
- Tree-depth wikiPageUsesTemplate Template:About.
- Tree-depth wikiPageUsesTemplate Template:Citation.
- Tree-depth wikiPageUsesTemplate Template:Harvtxt.
- Tree-depth wikiPageUsesTemplate Template:Reflist.
- Tree-depth wikiPageUsesTemplate Template:Sfnp.
- Tree-depth subject Category:Graph_coloring.
- Tree-depth subject Category:Graph_invariants.
- Tree-depth subject Category:Graph_minor_theory.
- Tree-depth hypernym Invariant.
- Tree-depth type Invariant.
- Tree-depth type Object.
- 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=682312263.
- Tree-depth depiction Tree-depth.svg.
- Tree-depth isPrimaryTopicOf Tree-depth.