Login / Signup
Two Deterministic Strategies for Finding Shortest Pairs of Edge-disjoint Paths.
Marina Girolimetto
Marcia Helena Moreira Paiva
Claunir Pavan
Fabio O. Lima
Rodrigo Stange Tessinari
Published in:
SSN (2017)
Keyphrases
</>
disjoint paths
approximation algorithms
directed graph
undirected graph
pairwise
real time
multiscale
edge detection
data mining
website