A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networks.

Maxim A. Babenko Ignat I. Kolesnichenko Ilya P. Razenshteyn

Published in: SOFSEM (2010)

Keyphrases

disjoint paths
approximation algorithms
directed graph
undirected graph
social networks
multi dimensional
complex networks
network analysis
learning algorithm
image segmentation
upper bound
computer networks
network design
network topologies