Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs.
Eric ChangChung-Kuan ChengAnushka GuptaPo-Ya HsuAmanda MoffittAlissa RenIrene TsaurSamuel WangPublished in: Networks (2020)
Keyphrases
- empirical studies
- random graphs
- strongly connected
- undirected graph
- minimum cost
- spanning tree
- directed graph
- graph theoretic
- real world data sets
- empirical analysis
- approximation algorithms
- optimum path forest
- phase transition
- connected components
- learning curves
- complex networks
- graph structure
- small world
- directed acyclic graph
- uci datasets
- np complete