Undirected Graphs: Is the Shift-Enabled Condition Trivial or Necessary?
Liyan ChenSamuel ChengKanghang HeVladimir StankovicLina StankovicPublished in: IEEE Access (2021)
Keyphrases
- undirected graph
- directed graph
- approximation algorithms
- directed acyclic graph
- complex networks
- minimum cost
- graph structure
- spanning tree
- disjoint paths
- vertex set
- multicommodity flow
- positive integer
- markov models
- connected components
- random graphs
- strongly connected
- objective function
- special case
- social networks