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

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

Published in: CoRR (2010)

Keyphrases

disjoint paths
approximation algorithms
directed graph
undirected graph
social networks
network model
strongly connected
np hard
complex networks
level set method
partial differential equations
database
graphical models
edge detection
query processing
neural network
real time