Simultaneously Dominating all Spanning Trees of a Graph

A subset of the vertices of a graph is a simultaneous dominating set for spanning trees if it is a dominating set in every spanning tree of the graph. We consider the problem of finding a minimum size simultaneous dominating set for spanning trees. We show that the decision version of this problem i...

Full description

Saved in:
Bibliographic details
Main Author: Johann, Sebastian S
Krumke, Sven O
Streicher, Manuel
Format: Publication
Language: English
Place of publication: 30.10.2018
Data of publication: 2018-10-30
Online Access: available in Bonn?
Database: OpenAIRE (Open Access)
Database information Databases - DBIS