Isomorphism Problem for Sd-Graphs

D 2020

Isomorphism Problem for Sd-Graphs

AGAOGLU, Deniz and Petr HLINĚNÝ

Basic information

Original name

Isomorphism Problem for Sd-Graphs

Authors

AGAOGLU, Deniz (792 Turkey, belonging to the institution) and Petr HLINĚNÝ (203 Czech Republic, guarantor, belonging to the institution)

Edition

Dagstuhl, Germany, 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), p. "4:1"-"4:14", 14 pp. 2020

Publisher

Schloss Dagstuhl - Leibniz-Zentrum fur Informatik

Other information

Language

English

Type of outcome

Stať ve sborníku

Field of Study

10201 Computer sciences, information science, bioinformatics

Country of publisher

Germany

Confidentiality degree

není předmětem státního či obchodního tajemství

Publication form

electronic version available online

RIV identification code

RIV/00216224:14330/20:00114291

Organization unit

Faculty of Informatics

ISBN

978-3-95977-159-7

ISSN

DOI

http://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4

Keywords in English

intersection graph; isomorphism testing; interval graph; H-graph

Abstract

V originále

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.

Links

GA20-04567S, research and development project

Name: Struktura efektivně řešitelných případů těžkých algoritmických problémů na grafech

Investor: Czech Science Foundation

MUNI/A/1050/2019, interní kód MU

Name: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace IX (Acronym: SV-FI MAV IX)

Investor: Masaryk University, Category A

MUNI/A/1076/2019, interní kód MU

Name: Zapojení studentů Fakulty informatiky do mezinárodní vědecké komunity 20 (Acronym: SKOMU)

Investor: Masaryk University, Category A

Citovat

AGAOGLU, Deniz and Petr HLINĚNÝ. Isomorphism Problem for Sd-Graphs. Online. In Javier Esparza and Daniel Kral. 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 2020, p. "4:1"-"4:14", 14 pp. ISBN 978-3-95977-159-7. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4.

@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. Online. 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, 2020, p.~''4:1''-''4:14'', 14 pp. ISBN~978-3-95977-159-7. Available from: https://dx.doi.org/10.4230/LIPIcs.MFCS.2020.4.

Detailed Information on Publication Record