This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
David Eppstein, Michael T. Goodrich, Darren Strash
In this work, we extend a common framework for seeded
image segmentation that includes the graph cuts, ran-
dom walker, and shortest path optimization algorithms.
Viewing an ima...
Camille Couprie, Leo Grady, Laurent Najman, Hugues...
The conditional diameter D of a digraph G measures how far apart a pair of vertex sets V1 and V2 can be in such a way that the minimum out-degree and the minimum in-degree of the ...