Efficient enumeration of non-isomorphic interval graphs

06/10/2019
by   Patryk Mikos, et al.
0

Recently, Yamazaki et al. provided an algorithm that enumerates all non-isomorphic interval graphs on n vertices with an O(n^6) time delay. In this paper, we improve their algorithm and achieve O(n^3 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2023

Obstruction characterization of co-TT graphs

Threshold tolerance graphs and their complement graphs ( known as co-TT ...
research
12/03/2018

Total 2-domination of proper interval graphs

A set of vertices W of a graph G is a total k-dominating set when every ...
research
09/24/2022

Impact of a non-deterministic rekey interval on the performance of arc4random

This paper is intended to provide the readers with a clear understanding...
research
02/05/2019

Unary Patterns of Size Four with Morphic Permutations

We investigate the avoidability of unary patterns of size of four with m...
research
05/15/2020

Breadth-First Rank/Select in Succinct Trees and Distance Oracles for Interval Graphs

We present the first succinct data structure for ordinal trees that supp...
research
10/11/2021

A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs

We provide an algorithm requiring only O(N^2) time to compute the maximu...
research
02/23/2018

On Streaming Algorithms for the Steiner Cycle and Path Cover Problem on Interval Graphs and Falling Platforms in Video Games

We introduce a simplified model for platform game levels with falling pl...

Please sign up or login with your details

Forgot password? Click here to reset