DAG-width - Connectivity Measure for Directed Graphs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F06%3A00016845" target="_blank" >RIV/00216224:14330/06:00016845 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
DAG-width - Connectivity Measure for Directed Graphs
Original language description
Tree-width is a very useful connectivity measure for undirected graphs. We propose a new definition, called DAG-width, for directed graphs which measures how close a graph is to a directed acyclic graph. In addition we define a cops-and-robber game and show that this game characterises exactly the class of graphs of bounded DAG-width. A comparison of DAG-width with tree-width and directed tree-width follows. Finally we show that NP-complete problems can be solved in polynomial time on graphs of boundedDAG-width.
Czech name
DAG-width - míra spojitosti pro orientované grafy
Czech description
Tree-width je velmi užitečná míra souvislosti pro neorientované grafy. Navrhujeme novou definici, nazvanou DAG-width, pro orientované grafy, která měří jak blízko je daný graf orientovanému acyklickému grafu. Dále definujeme novou hru typu "četnícia zloděj" a ukážeme že tato hra charakterizuje přesně grafy s omezenou DAG-width. Dále následuje porovnání DAG-width s tree-width a directed tree-width. Nakonec ukážeme že NP-úplné problémy mohou být řešeny v polynomiálním čase na grafech s omezenouDAG-width.
Classification
Type
D - Article in proceedings
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
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
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
ISBN
0-89871-605-5
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
Association for Computing MAchinery/Society for Industrial and Applied Mathematics
Place of publication
New York/Philadelphia
Event location
Miami, FL, USA
Event date
Jan 1, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—