The most Vital Component

The most Vital Component problems

1. Max-Flow Problems

   • One Arc
     • Scott et al. (2006)
   • N Arcs
     • Single Source & Single Sink
       • Wollmer (1964)
       • Ratliff et al. (1975)
     • Dynamic Network
       • Morowati & Mehri (2012)
   • N Nodes
     • Jr & Chang (1974)

2. Shortest Path Problmes

   • One Arc
     • Corley & Shy (1982)
   • N Arcs
     • Malik et al (1989)
     • Ball et al (1989)
   • N Nodes
     • Minqing & Xuguang (2011)

3. Spanning Tree Problems

   • One Arc
     • Hsu et al. (1991)
   • N Arcs
     • Jan et al. (1992)
     • Jan & Chern (1993)
     • Liang & Shen (1997)
     • Shen (1999)
     • Liang (2001)