Go to the corresponding LIPIcs Volume Portal 
Kurita, Kazuhiro ; Wasa, Kunihiro ; Arimura, Hiroki ; Uno, Takeaki
pdfformat: 

@InProceedings{kurita_et_al:LIPIcs:2018:9956, author = {Kazuhiro Kurita and Kunihiro Wasa and Hiroki Arimura and Takeaki Uno}, title = {{Efficient Enumeration of Dominating Sets for Sparse Graphs}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {8:18:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770941}, ISSN = {18688969}, year = {2018}, volume = {123}, editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9956}, URN = {urn:nbn:de:0030drops99560}, doi = {10.4230/LIPIcs.ISAAC.2018.8}, annote = {Keywords: Enumeration algorithm, polynomial amortized time, dominating set, girth, degeneracy} }
Keywords:  Enumeration algorithm, polynomial amortized time, dominating set, girth, degeneracy  
Seminar:  29th International Symposium on Algorithms and Computation (ISAAC 2018)  
Issue Date:  2018  
Date of publication:  27.11.2018 