Research articles

search articles

My Pages

Stat

Members: 3645
Articles: 2'504'928
Articles rated: 2609

25 April 2024

» arxiv » 1506.7260

Article overview

Algorithmic Aspects of Upper Domination
Cristina Bazgan ; Ljiljana Brankovic ; Katrin Casel ; Henning Fernau ; Klaus Jansen ; Michael Lampis ; Mathieu Liedloff ; Jérôme Monnot ; Vangelis Th. Paschos ;
Date:	24 Jun 2015
Abstract:	In this paper we study combinatorial and algorithmic resp. complexity questions of upper domination, i.e., the maximum cardinality of a minimal dominating set in a graph. We give a full classification of the related maximisation and minimisation problems, as well as the related parameterised problems, on general graphs and on graphs of bounded degree, and we also study planar graphs.
Source:	arXiv, 1506.7260
Services:	Forum \| Review \| PDF \| Favorites

No review found.

Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.

browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)

ScienXe.org
» my Online CV
» Free

News, job offers and information for researchers and scientists:

home

contact

sitemap