Login / Signup
A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture.
Nicolas Lichiardopol
Published in:
Discret. Math. (2008)
Keyphrases
</>
lower bound
upper bound
graph structure
objective function
connected components
scheduling problem
graph theory
graph representation