Locally definable vertex set properties are efficiently enumerable
type: Item
instance of: scholarly article
title: Locally definable vertex set properties are efficiently enumerable
zbMATH Open document ID: 1472.05069
author: Sarah Blind
author: Nadia Creignou
author: Frédéric Olive
published in: Discrete Applied Mathematics
publication date: 2021-09-15T00:00:00Z
Mathematics Subject Classification ID: 05C30
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 7395740
zbMATH Keywords: enumeration
zbMATH Keywords: complexity
zbMATH Keywords: vertex set properties
MaRDI profile type: Publication
full work available at URL: j.dam.2020.05.037
OpenAlex ID: W3036899539
cites work: Treewidth and Pathwidth of Permutation Graphs
cites work: Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
cites work: Q5422499
cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration
cites work: On the number of minimal dominating sets on some graph classes
cites work: The Private Neighbor Cube
cites work: Combinatorial bounds via measure and conquer
cites work: Q4198056
cites work: Output-polynomial enumeration on graphs of bounded (local) linear MIM-width
cites work: Enumerating minimal connected dominating sets in graphs of bounded chordality
cites work: Enumeration of maximal irredundant sets for claw-free graphs
cites work: Interval graphs and related topics
cites work: On the Enumeration of Minimal Dominating Sets and Related Notions
cites work: On the Enumeration and Counting of Minimal Dominating sets in Interval and Permutation Graphs
DOI: 10.1016/J.DAM.2020.05.037
description: scientific article; zbMATH DE number 7395740