An Approximation for Finding a Smallest 2-Edge-Connected Subgraph Containing a Specified Spanning Tree.
Hiroshi NagamochiToshihide IbarakiPublished in: COCOON (1999)
Keyphrases
- spanning tree
- edge disjoint
- edge weights
- minimum spanning trees
- undirected graph
- weighted graph
- minimum spanning tree
- minimum cost
- minimum weight
- approximation algorithms
- np hard
- minimum total cost
- connected components
- strongly connected
- edge information
- root node
- edge detection
- bipartite graph
- social network analysis
- shortest path
- probabilistic model
- optimal solution