Pages that link to "Item:Q4962767"
From MaRDI portal
The following pages link to Combinatorial bounds via measure and conquer (Q4962767):
Displayed 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)
- Minimal dominating sets in graph classes: combinatorial bounds and enumeration (Q387008) (← links)
- Exact algorithms for dominating set (Q411862) (← links)
- On the number of optimal identifying codes in a twin-free graph (Q476309) (← links)
- On the number of minimal dominating sets on some graph classes (Q476916) (← links)
- Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph (Q526869) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- On partitioning a graph into two connected subgraphs (Q650911) (← links)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Maximum matchings and minimum dominating sets in Apollonian networks and extended tower of Hanoi graphs (Q1676361) (← links)
- The many facets of upper domination (Q1704853) (← links)
- Complexity of Grundy coloring and its variants (Q1752449) (← links)
- Covering and packing in linear space (Q1944195) (← links)
- Locally definable vertex set properties are efficiently enumerable (Q1983133) (← links)
- Efficient computation of permanents, with applications to boson sampling and random matrices (Q2133747) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- Computing optimal Steiner trees in polynomial space (Q2392926) (← links)
- Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← links)
- Subset feedback vertex sets in chordal graphs (Q2447531) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
- Minimal Dominating Sets in Graph Classes: Combinatorial Bounds and Enumeration (Q2891369) (← links)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Enumerating Minimal Tropical Connected Sets (Q2971136) (← links)
- Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611) (← links)
- Enumeration of Minimal Dominating Sets and Variants (Q3088292) (← links)
- Domination cover number of graphs (Q4634292) (← links)
- Below All Subsets for Minimal Connected Dominating Set (Q4683902) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- Forgotten domination, hyper domination and modified forgotten domination indices of graphs (Q5035088) (← links)
- Proximity Search for Maximal Subgraph Enumeration (Q5048293) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- NP-completeness results for partitioning a graph into total dominating sets (Q5918107) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
- Enumeration of minimal tropical connected sets (Q6057321) (← links)
- Binary programming formulations for the upper domination problem (Q6080758) (← links)
- ON THE SECOND DOMINATION HYPER INDEX OF GRAPH AND SOME GRAPH OPERATIONS (Q6115194) (← links)