Counting maximal independent sets in directed path graphs
type: Item
instance of: scholarly article
title: Counting maximal independent sets in directed path graphs
zbMATH Open document ID: 1371.68119
author: Min-Sheng Lin
author: Sheng-Huang Su
published in: Information Processing Letters
publication date: 2014-06-23T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6306372
zbMATH Keywords: maximal independent sets
zbMATH Keywords: counting problem
zbMATH Keywords: directed path graphs
MaRDI profile type: Publication
full work available at URL: j.ipl.2014.05.003
OpenAlex ID: W2016277208
cites work: The complexity of computing the permanent
cites work: The Complexity of Enumeration and Reliability Problems
cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs
cites work: Intersection graphs of paths in a tree
cites work: Trapezoid graphs and their coloring
cites work: Permutation Graphs and Transitive Graphs
cites work: Comparability graphs and intersection graphs
cites work: Counting the number of independent sets in chordal graphs
cites work: Fast and simple algorithms to count the number of vertex covers in an interval graph
cites work: The Number of Maximal Independent Sets in a Tree
cites work: Counting the number of vertex covers in a trapezoid graph
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
DOI: 10.1016/J.IPL.2014.05.003
description: scientific article; zbMATH DE number 6306372