Login / Signup

Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes.

Arash HaddadanAlantha Newman
Published in: Discret. Optim. (2021)
Keyphrases
  • convex combinations
  • generalization bounds
  • connected subgraphs
  • convex hull
  • high dimensional
  • class labels
  • graph mining
  • kernel machines