Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.IPEC.2019.20
URN: urn:nbn:de:0030-drops-114812
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11481/
Hamm, Thekla
Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time
| pdf-format: |
|
Abstract
Cutwidth is a fundamental graph layout parameter. It generalises to hypergraphs in a natural way and has been studied in a wide range of contexts. For graphs it is known that for a fixed constant k there is a linear time algorithm that for any given G, decides whether G has cutwidth at most k and, in the case of a positive answer, outputs a corresponding linear arrangement. We show that such an algorithm also exists for hypergraphs.
BibTeX - Entry
@InProceedings{hamm:LIPIcs:2019:11481,
author = {Thekla Hamm},
title = {{Finding Linear Arrangements of Hypergraphs with Bounded Cutwidth in Linear Time}},
booktitle = {14th International Symposium on Parameterized and Exact Computation (IPEC 2019)},
pages = {20:1--20:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-129-0},
ISSN = {1868-8969},
year = {2019},
volume = {148},
editor = {Bart M. P. Jansen and Jan Arne Telle},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11481},
URN = {urn:nbn:de:0030-drops-114812},
doi = {10.4230/LIPIcs.IPEC.2019.20},
annote = {Keywords: Fixed parameter linear, Path decomposition, Hypergraph}
}
| Keywords: | Fixed parameter linear, Path decomposition, Hypergraph | |
| Seminar: | 14th International Symposium on Parameterized and Exact Computation (IPEC 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 04.12.2019 |
