A note on k-strongly connected orientations of an undirected graph.
András FrankPublished in: Discret. Math. (1982)
Keyphrases
- strongly connected
- undirected graph
- directed graph
- optimum path forest
- spanning tree
- approximation algorithms
- directed acyclic graph
- disjoint paths
- positive integer
- graph structure
- minimum cost
- random graphs
- complex networks
- adjacency matrix
- random walk
- image processing
- computer vision
- edge weights
- vertex set
- association rules
- bayesian networks