Finding the root graph through minimum edge deletion.
Martine LabbéAlfredo MarínMercedes PelegrínPublished in: Eur. J. Oper. Res. (2021)
Keyphrases
- weighted graph
- edge disjoint
- spanning tree
- strongly connected
- undirected graph
- edge weights
- contour closure
- disjoint paths
- directed graph
- graph structure
- vertex set
- bipartite graph
- graph theory
- graph model
- maximum clique
- edge detection
- constant factor
- graph clustering
- random walk
- graph representation
- edge information
- dominating set
- minimum total cost
- graph theoretic
- graph search
- edge map
- directed acyclic graph
- edge detector
- tree structure
- multiscale