Login / Signup

How to make a digraph strongly connected.

András Frank
Published in: Comb. (1981)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • series parallel
  • undirected graph
  • xml keys