Geodesic
Efficient enumeration of non-isomorphic interval graphs
Discrete mathematics & theoretical computer science, Tome 23 (2021-2022) no. 1.

Voir la notice de l'article provenant de la source Episciences

Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on $n$ vertices with an $O(n^4)$ time delay. In this paper, we improve their algorithm and achieve $O(n^3 \log n)$ time delay. We also extend the catalog of these graphs providing a list of all non-isomorphic interval graphs for all $n$ up to $15$.
DOI : 10.46298/dmtcs.6164
Classification : 05C30, 05C85 
@article{DMTCS_2021_23_1_a3,
     author = {Mikos, Patryk},
     title = {Efficient enumeration of non-isomorphic interval graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {23},
     number = {1},
     year = {2021-2022},
     doi = {10.46298/dmtcs.6164},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6164/}
}
TY  - JOUR
AU  - Mikos, Patryk
TI  - Efficient enumeration of non-isomorphic interval graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2021-2022
VL  - 23
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6164/
DO  - 10.46298/dmtcs.6164
LA  - en
ID  - DMTCS_2021_23_1_a3
ER  - 
%0 Journal Article
%A Mikos, Patryk
%T Efficient enumeration of non-isomorphic interval graphs
%J Discrete mathematics & theoretical computer science
%D 2021-2022
%V 23
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6164/
%R 10.46298/dmtcs.6164
%G en
%F DMTCS_2021_23_1_a3
Mikos, Patryk. Efficient enumeration of non-isomorphic interval graphs. Discrete mathematics & theoretical computer science, Tome 23 (2021-2022) no. 1. doi : 10.46298/dmtcs.6164. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.6164/

Cité par Sources :