Asymptotic enumeration of strongly connected digraphs by vertices and edges.
Xavier Pérez-GiménezNicholas C. WormaldPublished in: Random Struct. Algorithms (2013)
Keyphrases
- strongly connected
- directed graph
- undirected graph
- directed edges
- random walk
- optimum path forest
- edge weights
- directed acyclic graph
- graph structure
- complex networks
- connected components
- spanning tree
- expected values
- approximation algorithms
- minimum cost
- asymptotically optimal
- weighted graph
- worst case
- dynamic programming
- search space
- multiscale
- vertex set
- np hard
- laplace transform
- support vector