On the Euclidian Metric for Undirected Graphs and Exact Calculations.
Victor A. RusakovPublished in: BICA (2020)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- spanning tree
- connected components
- disjoint paths
- graph structure
- random graphs
- complex networks
- minimum cost
- strongly connected
- vertex set
- positive integer
- random walk
- data streams
- network structure
- undirected graphical models
- average degree
- markov random field