Pages that link to "Item:Q5246092"

The following pages link to On the Enumeration of Minimal Dominating Sets and Related Notions (Q5246092):

Displaying 44 items.

• Enumerating minimal connected dominating sets in graphs of bounded chordality (Q278724) (← links)
• Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230) (← links)
• Minimal dominating sets in interval graphs and trees (Q344851) (← links)
• Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs (Q477326) (← links)
• An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
• Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
• Enumerating minimal dominating sets in chordal graphs (Q738877) (← links)
• Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
• Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
• The many facets of upper domination (Q1704853) (← links)
• Output-polynomial enumeration on graphs of bounded (local) linear MIM-width (Q1709594) (← links)
• Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
• Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
• Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
• On the dualization in distributive lattices and related problems (Q2030249) (← links)
• Extension and its price for the connected vertex cover problem (Q2072064) (← links)
• Elimination properties for minimal dominating sets of graphs (Q2107746) (← links)
• Enumeration of maximal common subsequences between two strings (Q2118209) (← links)
• Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
• Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
• A complexity theory for hard enumeration problems (Q2274092) (← links)
• Uniform clutters and dominating sets of graphs (Q2420426) (← links)
• Extended dualization: application to maximal pattern mining (Q2634673) (← links)
• Invited talks (Q2692717) (← links)
• Upper Domination: Complexity and Approximation (Q2819508) (← links)
• A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs (Q2827808) (← links)
• Counting Minimal Dominating Sets (Q2988832) (← links)
• Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
• Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs (Q3449842) (← links)
• Enumerating Minimal Transversals of Hypergraphs without Small Holes (Q5005157) (← links)
• Connected domination game (Q5028806) (← links)
• Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
• Enumerating Minimal Dominating Sets in Triangle-Free Graphs (Q5090462) (← links)
• (Q5090998) (← links)
• Randomized generation of error control codes with automata and transducers (Q5223614) (← links)
• Linear separation of connected dominating sets in graphs (Q5225055) (← links)
• Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
• Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
• Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
• Polynomial-delay enumeration of maximal common subsequences (Q6536255) (← links)
• Minimal Roman dominating functions: extensions and enumeration (Q6547209) (← links)
• An approximation algorithm for \(K\)-best enumeration of minimal connected edge dominating sets with cardinality constraints (Q6562874) (← links)
• Generating minimal redundant and maximal irredundant subhypergraphs (Q6611070) (← links)
• Polynomial delay hybrid algorithms to enumerate candidate keys for a relation (Q6648284) (← links)