A Linear-Time Parameterized Algorithm for Node Unique Label Cover

Lokshtanov, Daniel; Ramanujan, M. S.; Saurabh, Saket

doi:10.4230/LIPIcs.ESA.2017.57

by Daniel Lokshtanov, M. S. Ramanujan, Saket Saurabh

Reference:

A Linear-Time Parameterized Algorithm for Node Unique Label CoverDaniel Lokshtanov, M. S. Ramanujan, Saket Saurabh25th Annual European Symposium on Algorithms (ESA 2017) (Kirk Pruhs, Christian Sohler, eds.), volume 87 of Leibniz International Proceedings in Informatics (LIPIcs), pages 57:1–57:15, 2017, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@inProceedings{lokshtanovRamanujanSaurabh17nodeulc,
  author ={Daniel Lokshtanov and M. S. Ramanujan and Saket Saurabh},
  title ={{A Linear-Time  Parameterized Algorithm for Node Unique Label Cover}},
  booktitle ={25th Annual European Symposium on Algorithms (ESA 2017)},
  pages ={57:1--57:15},
  series ={Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN ={978-3-95977-049-1},
  ISSN ={1868-8969},
  year ={2017},
  volume ={87},
  editor ={Kirk Pruhs and Christian Sohler},
  publisher ={Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address ={Dagstuhl, Germany},
  URL ={http://drops.dagstuhl.de/opus/volltexte/2017/7815},
  URN ={urn:nbn:de:0030-drops-78152},
  doi ={10.4230/LIPIcs.ESA.2017.57},
  annote ={Keywords: Algorithms and data structures, Fixed Parameter Tractability, Unique Label Cover, Linear Time FPT Algorithms.},
  keywords={xtract}
}