Proceedings Article, Paper
@InProceedings
Beitrag in Tagungsband, Workshop


Show entries of:

this year (2019) | last year (2018) | two years ago (2017) | Notes URL

Action:

login to update

Options:




Library Locked Library locked




Author, Editor

Author(s):

Philip, Geevarghese
Raman, Venkatesh
Sikdar, Somnath

dblp
dblp
dblp

Not MPG Author(s):

Raman, Venkatesh
Sikdar, Somnath

Editor(s):

Fiat, Amos
Sanders, Peter

dblp
dblp

Not MPII Editor(s):

Fiat, Amos
Sanders, Peter

BibTeX cite key*:

PhilipRamanSikdar2009

Title, Booktitle

Title*:

Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels


ds_kernel_LNCS.pdf (183.66 KB)

Booktitle*:

Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings

Event, URLs

URL of the conference:

http://algo2009.itu.dk/esa-2009

URL for downloading the paper:

http://www.springerlink.com/content/t074t27u14373735/

Event Address*:

Copenhagen, Denmark

Language:

English

Event Date*
(no longer used):


Organization:


Event Start Date:

7 September 2009

Event End Date:

9 September 2009

Publisher

Name*:

Springer

URL:

http://www.springer.com

Address*:

Berlin

Type:


Vol, No, Year, pp.

Series:

Lecture Notes in Computer Science

Volume:

5757

Number:


Month:


Pages:

694-705

Year*:

2009

VG Wort Pages:


ISBN/ISSN:

978-3-642-04127-3

Sequence Number:


DOI:

10.1007/978-3-642-04128-0_62



Note, Abstract, ©


(LaTeX) Abstract:

We show that the \noun{$k$-Dominating Set} problem is fixed parameter
tractable (FPT) and has a polynomial kernel for any class of graphs
that exclude $K_{i,j}$ as a subgraph, for any fixed $i,j\ge1$. This
strictly includes every class of graphs for which this problem has
been previously shown to have FPT algorithms and/or polynomial kernels.
In particular, our result implies that the problem restricted to bounded-degenerate
graphs has a polynomial kernel, solving an open problem posed by Alon
and Gutner.

URL for the Abstract:

http://www.springerlink.com/content/t074t27u14373735/

Keywords:

Parameterized Complexity, Kernelization, Dominating Set

Copyright Message:

Copyright Springer-Verlag Berlin Heidelberg 2009. This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,
in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law.

Published in the Proceedings of ESA 2009, Copenhagen, Denmark, September 7-9, 2009. Lecture Notes in Computer Science, Volume 5757. The original publication is available at www.springerlink.com : http://www.springerlink.com/content/t074t27u14373735/


Download
Access Level:

Public

Correlation

MPG Unit:

Max-Planck-Institut für Informatik



MPG Subunit:

Algorithms and Complexity Group

Audience:

experts only

Appearance:

MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort



BibTeX Entry:

@INPROCEEDINGS{PhilipRamanSikdar2009,
AUTHOR = {Philip, Geevarghese and Raman, Venkatesh and Sikdar, Somnath},
EDITOR = {Fiat, Amos and Sanders, Peter},
TITLE = {Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels},
BOOKTITLE = {Algorithms - ESA 2009, 17th Annual European Symposium, Copenhagen, Denmark, September 7-9, 2009. Proceedings},
PUBLISHER = {Springer},
YEAR = {2009},
VOLUME = {5757},
PAGES = {694--705},
SERIES = {Lecture Notes in Computer Science},
ADDRESS = {Copenhagen, Denmark},
ISBN = {978-3-642-04127-3},
DOI = {10.1007/978-3-642-04128-0_62},
}


Entry last modified by Geevarghese Philip, 07/08/2014
Show details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
[Library]
Created
04/21/2012 04:08:26 PM
Revisions
3.
2.
1.
0.
Editor(s)
Geevarghese Philip
Geevarghese Philip
Geevarghese Philip
Geevarghese Philip
Edit Dates
04/21/2012 04:37:07 PM
04/21/2012 04:11:54 PM
04/21/2012 04:10:48 PM
04/21/2012 04:08:26 PM
Show details for Attachment SectionAttachment Section
Hide details for Attachment SectionAttachment Section

View attachments here:


File Attachment Icon
ds_kernel_LNCS.pdf