Supermodularity in Unweighted Graph Optimization I: Branchings and Matchings.
Kristóf BércziAndrás FrankPublished in: CoRR (2016)
Keyphrases
- graph theory
- maximum cardinality
- edge weights
- graph representation
- global optimization
- random walk
- optimization process
- weighted graph
- graph theoretic
- optimization problems
- directed graph
- discrete optimization
- spanning tree
- undirected graph
- constrained optimization
- dependency graph
- graph search
- graph construction
- minimum weight
- graph model
- social networks
- bipartite graph
- connected components
- optimization algorithm
- lower bound