About: Exponential time algorithms for the minimum dominating set problem on some graph classes   Goto Sponge  NotDistinct  Permalink

An Entity of Type : owl:Thing, within Data Space : data.idref.fr associated with source document(s)

AttributesValues
Author
Bibliographic Citation
  • ACM Transactions on Algorithms, Association for Computing Machinery, 2009, 6, pp.article 9. ⟨10.1145/1644015.1644024⟩
  • Gaspers Serge, Kratsch Dieter, Liedloff Mathieu, Todinca Ioan. Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms, Association for Computing Machinery, 2009, 6, pp.article 9. ⟨10.1145/1644015.1644024⟩
Title
  • Exponential time algorithms for the minimum dominating set problem on some graph classes
dc:date
  • 2009
Faceted Search & Find service v1.13.91 as of Aug 16 2018


Alternative Linked Data Documents: ODE     Content Formats:       RDF       ODATA       Microdata      About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data]
OpenLink Virtuoso version 07.20.3229 as of May 14 2019, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (70 GB total memory)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software