Two Arc-Disjoint Paths in Eulerian Digraphs.
András FrankToshihide IbarakiHiroshi NagamochiPublished in: SIAM J. Discret. Math. (1998)
Keyphrases
- disjoint paths
- directed graph
- undirected graph
- approximation algorithms
- directed acyclic graph
- random walk
- equivalence classes
- level set method
- computer vision
- np hard
- complex networks
- network flow problem
- graph structure
- partial differential equations
- nearest neighbor
- special case
- artificial neural networks
- training set
- feature space
- pattern recognition
- data structure