Thèse, GALaC, Computer Science, Discrete Mathematics, Mathématique discrète

A guide book for the traveller on graphs full of blockages

Pierre Bergé. A guide book for the traveller on graphs full of blockages. Computational Complexity [cs.CC]. Université Paris Saclay (COmUE), 2019. English. ⟨NNT : 2019SACLS480⟩. ⟨tel-02887092⟩

Published on