Enumerating Minimal Connected Dominating Sets

Authors

Institutions

Publication Details

Journal
SIAM Journal on Discrete Mathematics
Published
2025-05-06
DOI
https://doi.org/10.1137/23m1611233
Citations
3
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
4.51

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enumerating Minimal Connected Dominating Sets

Henning Fernau, Benjamin Gras, Kevin Mann, Mathieu Liedloff et al.
3 citations
SIAM Journal on Discrete Mathematics
Advanced Graph Theory Research
4.51
article

Enumerating Minimal Connected Dominating Sets

Henning Fernau, Benjamin Gras, Kevin Mann, Mathieu Liedloff, Faisal N. Abu-Khzam
article en
3 citations

Abstract

No abstract available for this paper.
SIAM Journal on Discrete MathematicsVol. 39(2)
Université d'Orléans (FR), Institut National des Sciences Appliquées Centre Val de Loire (FR), Lebanese American University (LB), Universität Trier (DE)
Université d'Orléans
Openalex Percentile: Top 6%
Advanced Graph Theory Research
4.51
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.