Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1676036,
author = {Agaoglu, Deniz and Hliněný, Petr},
address = {Dagstuhl, Germany},
booktitle = {45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)},
doi = {http://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4},
editor = {Javier Esparza and Daniel Kral},
keywords = {intersection graph; isomorphism testing; interval graph; H-graph},
howpublished = {elektronická verze "online"},
language = {eng},
location = {Dagstuhl, Germany},
isbn = {978-3-95977-159-7},
pages = {"4:1"-"4:14"},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fur Informatik},
title = {Isomorphism Problem for Sd-Graphs},
year = {2020}
}
TY - JOUR
ID - 1676036
AU - Agaoglu, Deniz - Hliněný, Petr
PY - 2020
TI - Isomorphism Problem for Sd-Graphs
PB - Schloss Dagstuhl - Leibniz-Zentrum fur Informatik
CY - Dagstuhl, Germany
SN - 9783959771597
KW - intersection graph
KW - isomorphism testing
KW - interval graph
KW - H-graph
N2 - An H-graph is the intersection graph of connected subgraphs of a suitable subdivision of a fixed graph H, introduced by Biró, Hujter and Tuza (1992). We focus on S_d-graphs as a special case generalizing interval graphs. A graph G is an S_d-graph iff it is the intersection graph of connected subgraphs of a subdivision of a star S_d with d rays. We give an FPT algorithm to solve the isomorphism problem for S_d-graphs with the parameter d. This solves an open problem of Chaplick, Töpfer, Voborník and Zeman (2016). In the course of our proof, we also show that the isomorphism problem of S_d-graphs is computationally at least as hard as the isomorphism problem of posets of bounded width.
ER -
AGAOGLU, Deniz and Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. In Javier Esparza and Daniel Kral. \textit{45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020)}. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik. p.~''4:1''-''4:14'', 14 pp. ISBN~978-3-95977-159-7. doi:10.4230/LIPIcs.MFCS.2020.4. 2020.
|
