Keyword

dominating sets

Description: Dominating sets are vertex subsets of a graph such that every vertex belongs to the subset or is adjacent to one of its vertices.

Primary topic: Advanced Graph Theory Research (66%)

Wikidata ID: wiki/Q2915204

OpenAlex ID: keywords/dominating-sets

Parameterized Complexity

2002 · Michael R. Fellows · Electronic Notes in Theoretical Computer Science · 2,837

PDF

Theory of graphs

1962 · Öystein Ore · Medical Entomology and Zoology · 1,510

Domination in graphs : advanced topics

1998 · Teresa W. Haynes, Stephen T. Hedetniemi, et al. · Digital Commons - East Tennessee State University (East Tennessee State University) · 1,391

A Best Possible Heuristic for the k-Center Problem

1985 · Dorit S. Hochbaum, David B. Shmoys · Mathematics of Operations Research · 920

On the hardness of approximating minimization problems

1994 · Carsten Lund, Mihalis Yannakakis · Journal of the ACM · 896

PDF

Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks

2002 · I. Stojmenovic, M. Seddigh, et al. · IEEE Transactions on Parallel and Distributed Systems · 870

Towards a theory of domination in graphs

1977 · E. J. Cockayne, S. T. Hedetniemi · Networks · 633

A combinatorial theorem in plane geometry

1975 · V Chvátal · Journal of Combinatorial Theory Series B · 604

PDF

Linear time algorithms for NP-hard problems restricted to partial k-trees

1989 · Stefan Arnborg, Andrzej Proskurowski · Discrete Applied Mathematics · 577

Fixed-Parameter Tractability and Completeness I: Basic Results

1995 · Rod G. Downey, Michael R. Fellows · SIAM Journal on Computing · 468

Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs

2005 · Erik D. Demaine, Fedor V. Fomin, et al. · Journal of the ACM · 324

Relations between packing and covering numbers of a tree

1975 · A. Meir, John Moon · Pacific Journal of Mathematics · 282

PDF

Connectivity based k-hop clustering in wireless networks

2003 · Geng Chen, F.G. Nocetti, et al. · Proceedings of the ... Annual Hawaii International Conference on System Sciences/Proceedings of the Annual Hawaii International Conference on System Sciences · 260

Strong computational lower bounds via parameterized complexity

2006 · Jianer Chen, Xiuzhen Huang, et al. · Journal of Computer and System Sciences · 255

Graph‐theoretic parameters concerning domination, independence, and irredundance

1979 · B. Bollobás, E. J. Cockayne · Journal of Graph Theory · 220

On the hardness of approximating minimization problems

1993 · Carsten Lund, Mihalis Yannakakis · ACM Symposium on Theory of Computing (STOC) · 216

PDF

Domination, independent domination, and duality in strongly chordal graphs

1984 · Martin Farber · Discrete Applied Mathematics · 214

PDF

Learning a SAT Solver from Single-Bit Supervision

2018 · Selsam, Daniel, Lamm, Matthew, et al. · arXiv (Cornell University) · 213

PDF

Linear-time computation of optimal subgraphs of decomposable graphs

1987 · M.W Bern, E.L Lawler, et al. · Journal of Algorithms · 206

Domination and location in acyclic graphs

1987 · Peter J. Slater · Networks · 206

Domination in Graphs

2013 · Teresa Haynes, Michael Henning · Discrete mathematics and its applications · 192

Network layer support for service discovery in mobile ad hoc networks

2004 · U.C. Kozat, L. Tassiulas · 191

PDF

Dominating sets for split and bipartite graphs

1984 · Alan A. Bertossi · Information Processing Letters · 191

Bidimensionality and kernels

2010 · Fedor V. Fomin, Daniel Lokshtanov, et al. · Symposium on Discrete Algorithms · 189

Approximating theDomatic Number

2002 · Uriel Feige, Magnús M. Halldórsson, et al. · SIAM Journal on Computing · 187

Works count: 3,504

Citation count: 38,870