Efficient enumeration of non-isomorphic interval graphs
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-iso...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado: |
Discrete Mathematics & Theoretical Computer Science
2021-03-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Assuntos: | |
| Acceso en liña: | https://dmtcs.episciences.org/6164/pdf |
| Tags: |
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|