Enumerating minimal dominating sets in chordal graphs (Q738877): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Graph Classes: A Survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the number of minimal dominating sets on some graph classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On rigid circuit graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Exact exponential algorithms. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic graph theory and perfect graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Enumeration of Minimal Dominating Sets and Related Notions / rank | |||
Normal rank |
Revision as of 10:15, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Enumerating minimal dominating sets in chordal graphs |
scientific article |
Statements
Enumerating minimal dominating sets in chordal graphs (English)
0 references
16 August 2016
0 references
input sensitive enumeration
0 references
branching algorithm
0 references
maximum number of minimal dominating sets
0 references
chordal graphs
0 references
graph algorithms
0 references