Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Jean-François Couturier; Pinar Heggernes; Pim van 't Hof; Dieter Kratsch

doi:10.1007/978-3-642-27660-6_17

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

Jean-François Couturier, Pinar Heggernes, Pim van 't Hof, Dieter Kratsch

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

Original language	English
Title of host publication	SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings
Editors	Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, György Turán
Publisher	Springer
Pages	202-213
Number of pages	12
ISBN (Electronic)	978-3-642-27660-6
ISBN (Print)	978-3-642-27659-0
DOIs	https://doi.org/10.1007/978-3-642-27660-6_17
Publication status	Published - 2012
Externally published	Yes
Event	38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012 - Špindlerův Mlýn, Czech Republic Duration: 21 Jan 2012 → 27 Jan 2012 Conference number: 38

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7147

Conference

Conference	38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012
Abbreviated title	SOFSEM 2012
Country/Territory	Czech Republic
City	Špindlerův Mlýn
Period	21/01/12 → 27/01/12

Access to Document

10.1007/978-3-642-27660-6_17

Cite this

Couturier, J.-F., Heggernes, P., van 't Hof, P., & Kratsch, D. (2012). Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. In M. Bieliková, G. Friedrich, G. Gottlob, S. Katzenbeisser, & G. Turán (Eds.), SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings (pp. 202-213). (Lecture Notes in Computer Science; Vol. 7147). Springer. https://doi.org/10.1007/978-3-642-27660-6_17

Couturier, Jean-François ; Heggernes, Pinar ; van 't Hof, Pim et al. / Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings. editor / Mária Bieliková ; Gerhard Friedrich ; Georg Gottlob ; Stefan Katzenbeisser ; György Turán. Springer, 2012. pp. 202-213 (Lecture Notes in Computer Science).

@inproceedings{bc576542de5d466aa36c00628e699ce7,

title = "Minimal dominating sets in graph classes: Combinatorial bounds and enumeration",

author = "Jean-Fran{\c c}ois Couturier and Pinar Heggernes and {van 't Hof}, Pim and Dieter Kratsch",

year = "2012",

doi = "10.1007/978-3-642-27660-6_17",

language = "English",

isbn = "978-3-642-27659-0",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "202--213",

editor = "M{\'a}ria Bielikov{\'a} and Gerhard Friedrich and Georg Gottlob and Stefan Katzenbeisser and Gy{\"o}rgy Tur{\'a}n",

booktitle = "SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Ml{\'y}n, Czech Republic, January 21-27, 2012. Proceedings",

address = "Germany",

note = "38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, SOFSEM 2012 ; Conference date: 21-01-2012 Through 27-01-2012",

}

Couturier, J-F, Heggernes, P, van 't Hof, P & Kratsch, D 2012, Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. in M Bieliková, G Friedrich, G Gottlob, S Katzenbeisser & G Turán (eds), SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7147, Springer, pp. 202-213, 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012, Špindlerův Mlýn, Czech Republic, 21/01/12. https://doi.org/10.1007/978-3-642-27660-6_17

Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. / Couturier, Jean-François; Heggernes, Pinar; van 't Hof, Pim et al.
SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings. ed. / Mária Bieliková; Gerhard Friedrich; Georg Gottlob; Stefan Katzenbeisser; György Turán. Springer, 2012. p. 202-213 (Lecture Notes in Computer Science; Vol. 7147).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Minimal dominating sets in graph classes: Combinatorial bounds and enumeration

AU - Couturier, Jean-François

AU - Heggernes, Pinar

AU - van 't Hof, Pim

AU - Kratsch, Dieter

N1 - Conference code: 38

PY - 2012

Y1 - 2012

U2 - 10.1007/978-3-642-27660-6_17

DO - 10.1007/978-3-642-27660-6_17

M3 - Conference contribution

SN - 978-3-642-27659-0

T3 - Lecture Notes in Computer Science

SP - 202

EP - 213

BT - SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings

A2 - Bieliková, Mária

A2 - Friedrich, Gerhard

A2 - Gottlob, Georg

A2 - Katzenbeisser, Stefan

A2 - Turán, György

PB - Springer

T2 - 38th Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2012

Y2 - 21 January 2012 through 27 January 2012

ER -

Couturier JF, Heggernes P, van 't Hof P, Kratsch D. Minimal dominating sets in graph classes: Combinatorial bounds and enumeration. In Bieliková M, Friedrich G, Gottlob G, Katzenbeisser S, Turán G, editors, SOFSEM 2012: Theory and Practice of Computer Science - 38th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 21-27, 2012. Proceedings. Springer. 2012. p. 202-213. (Lecture Notes in Computer Science). doi: 10.1007/978-3-642-27660-6_17