Counting independent sets in cocomparability graphs

DOI10.1016/j.ipl.2018.12.005zbMath1405.05082arXiv1808.09853WikidataQ61821452 ScholiaQ61821452MaRDI QIDQ1721932

Haiko Müller, Martin Dyer

Publication date: 13 February 2019

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1808.09853

zbMATH Keywords

counting; independent set; graph algorithms; linear time algorithm; cocomparability graph

Mathematics Subject Classification ID

05C30: Enumeration in graph theory

05C85: Graph algorithms (graph-theoretic aspects)

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)