On Low Tree-Depth Decompositions

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10319511" target="_blank" >RIV/00216208:11320/15:10319511 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00373-015-1569-7" target="_blank" >http://dx.doi.org/10.1007/s00373-015-1569-7</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00373-015-1569-7" target="_blank" >10.1007/s00373-015-1569-7</a>

Result language
angličtina
Original language name
On Low Tree-Depth Decompositions
Original language description
The theory of sparse structures usually uses tree like structures as building blocks. In the context of sparse/dense dichotomy this role is played by graphs with bounded tree-depth. In this paper we survey results related to this concept and particularlyexplain how these graphs are used to decompose and construct more complex graphs and structures. In more technical terms we survey some of the properties and applications of low tree-depth decomposition of graphs.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)