Computing the fully optimal spanning tree of an ordered bipolar directed graph.
Emeric GioanMichel Las VergnasPublished in: Discret. Math. (2024)
Keyphrases
- directed graph
- spanning tree
- undirected graph
- minimum cost
- edge weights
- random walk
- minimum spanning tree
- minimum weight
- directed acyclic graph
- graph structure
- positive and negative
- edge disjoint
- shortest path problem
- leaf nodes
- maximum flow
- strongly connected
- graph properties
- minimum spanning trees
- minimum total cost
- directed edges
- dynamic programming
- disjoint paths
- optimal solution