Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths.

Published in: J. Graph Theory (2016)

Keyphrases

equivalence classes
branch and bound
search tree
von neumann
shortest path
path finding
databases
computer vision
information systems
image segmentation
video sequences
path planning
directed graph
optimal path
bi directional
finite dimensional