Efficient Enumeration Of Non-Isomorphic Interval Graphs

Discret. Math. Theor. Comput. Sci.（2021）

引用 0|浏览0

暂无评分

摘要

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.

查看译文

关键词

combinatorics, graph theory, enumeration, interval graphs

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要