-Edge-Connected Directed Graphs of Maximal Size.
Alex R. BergTibor JordánPublished in: Graphs Comb. (2005)
Keyphrases
- directed graph
- disjoint paths
- undirected graph
- strongly connected
- random walk
- directed acyclic graph
- maximum flow
- edge weights
- computational complexity
- edge detection
- connected components
- information systems
- edge information
- real time
- weighted graph
- edge map
- maximum number
- binary images
- graph structures
- state space
- case study