31 citations · 31 across the 7 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DM2014★ 31 cited
Polynomial-time Algorithms for Weighted Efficient Domination Problems in AT-free Graphs and Dually Chordal Graphs
Andreas Brandstädt, Pavel Fičur, Arne Leitert +1
An efficient dominating set (or perfect code) in a graph is a set of vertices the closed neighborhoods of which partition the vertex set of the graph. The minimum weight efficient…
cs.DS2014
Line-distortion, Bandwidth and Path-length of a graph
Feodor F. Dragan, Ekkehard Köhler, Arne Leitert
We investigate the minimum line-distortion and the minimum bandwidth problems on unweighted graphs and their relations with the minimum length of a Robertson-Seymour's path-decompo…