Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2018.44
URN: urn:nbn:de:0030-drops-96261
URL: https://drops.dagstuhl.de/opus/volltexte/2018/9626/
Deligkas, Argyrios ; Meir, Reshef
Directed Graph Minors and Serial-Parallel Width
| pdf-format: |
|
Abstract
Graph minors are a primary tool in understanding the structure of undirected graphs, with many conceptual and algorithmic implications. We propose new variants of directed graph minors and directed graph embeddings, by modifying familiar definitions. For the class of 2-terminal directed acyclic graphs (TDAGs) our two definitions coincide, and the class is closed under both operations. The usefulness of our directed minor operations is demonstrated by characterizing all TDAGs with serial-parallel width at most k; a class of networks known to guarantee bounded negative externality in nonatomic routing games. Our characterization implies that a TDAG has serial-parallel width of 1 if and only if it is a directed series-parallel graph. We also study the computational complexity of finding a directed minor and computing the serial-parallel width.
BibTeX - Entry
@InProceedings{deligkas_et_al:LIPIcs:2018:9626,
author = {Argyrios Deligkas and Reshef Meir},
title = {{Directed Graph Minors and Serial-Parallel Width}},
booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)},
pages = {44:1--44:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-086-6},
ISSN = {1868-8969},
year = {2018},
volume = {117},
editor = {Igor Potapov and Paul Spirakis and James Worrell},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9626},
URN = {urn:nbn:de:0030-drops-96261},
doi = {10.4230/LIPIcs.MFCS.2018.44},
annote = {Keywords: directed minors, pathwidth}
}
| Keywords: | directed minors, pathwidth | |
| Seminar: | 43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 27.08.2018 |
