Characterizing DAG-depth of Directed Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F16%3A00094253" target="_blank" >RIV/00216224:14330/16:00094253 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.4204/EPTCS.233.3" target="_blank" >http://dx.doi.org/10.4204/EPTCS.233.3</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.4204/EPTCS.233.3" target="_blank" >10.4204/EPTCS.233.3</a>
Alternative languages
Result language
angličtina
Original language name
Characterizing DAG-depth of Directed Graphs
Original language description
We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on directed graphs and prove its correctness. The DAG-depth decomposition is related to DAG-depth in a similar way as an elimination tree is related to the tree-depth. We study the size aspect of DAG-depth decomposition and provide a definition of mergeable and optimally mergeable vertices in order to make the decomposition smaller and acceptable for the cop player as a strategy. We also provide a way to find the closure of a DAG-depth decomposition, which is the largest digraph for which the given decomposition represents a winning strategy for the cop player.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE
ISBN
—
ISSN
2075-2180
e-ISSN
—
Number of pages
10
Pages from-to
23-32
Publisher name
OPEN PUBL ASSOC
Place of publication
SYDNEY
Event location
SYDNEY
Event date
Jan 1, 2016
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
000390333200004