7 citations · 7 across the 2 of their papers we have counts for
2 papers
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…
cs.DS2014★ 7 cited
Linear Time LexDFS on Cocomparability Graphs
Ekkehard Köhler, Lalla Mouatadid
Lexicographic depth first search (LexDFS) is a graph search protocol which has already proved to be a powerful tool on cocomparability graphs. Cocomparability graphs have been well…