Login / Signup

A Linear Time Algorithm for Computing Max-Flow Vitality in Undirected Unweighted Planar Graphs.

Giorgio AusielloLorenzo BalzottiPaolo Giulio FranciosaIsabella LariAndrea Ribichini
Published in: CoRR (2022)
Keyphrases
  • max flow
  • planar graphs
  • undirected graph
  • energy minimization
  • weighted graph
  • directed graph
  • graph cuts
  • directed acyclic graph
  • optimization problems
  • approximation algorithms