Structural Properties and Constant Factor-Approximation of Strong Distance-r Dominating Sets in Sparse Directed Graphs.
Stephan KreutzerRoman RabinovichSebastian SiebertzGrischa WeberstädtPublished in: STACS (2017)
Keyphrases
- structural properties
- directed graph
- random walk
- constant factor approximation
- tree width
- maximum flow
- directed acyclic graph
- distance measure
- topological properties
- high dimensional
- approximation algorithms
- np hard
- disjoint paths
- undirected graph
- network evolution
- graph structure
- binary images
- scheduling problem
- strongly connected
- lower bound