Skip to main content
Article thumbnail
Location of Repository

An Exact Algorithm for the Minimum Dominating Clique Problem



Basic Definitions. Let G = (V, E) be an undirected and simple graph, i.e.without loops and multiple edges. We denote b

Year: 2009
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • http://lita.sciences.univ-metz... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.