Supermodularity in Unweighted Graph Optimization III: Highly Connected Digraphs.

Kristóf Bérczi András Frank

Published in: Math. Oper. Res. (2018)

Keyphrases

highly connected
directed graph
undirected graph
optimization problems
optimization algorithm
edge weights
graph theory
equivalence classes
connected components
directed acyclic graph
graphical representation
databases
feature selection
objective function
graph theoretic
min sum