Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
On the hop-constrained Steiner tree problems
Adalat Jabrayilov
The hop-constrained Steiner tree problem (HSTP) is a generalization of the classical Steiner tree problem. It asks for a minimum cost subtree that spans some specified nodes of a g…
cs.DS2016
Compact Layered Drawings of General Directed Graphs
Adalat Jabrayilov, Sven Mallach, Petra Mutzel +2
We consider the problem of layering general directed graphs under height and possibly also width constraints. Given a directed graph G = (V,A) and a maximal height, we propose a la…