Communication dans un congrès, GALaC, Algorithme et structure de données, Informatique

Fixed-parameter tractability of counting small minimum (S,T)-cuts

Pierre Bergé, Benjamin Mouscadet, Arpad Rimmel, Joanna Tomasik. Fixed-parameter tractability of counting small minimum (S,T)-cuts. 45th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), Jun 2019, Vall de Núria, Spain. pp.79-92, ⟨10.1007/978-3-030-30786-8_7⟩. ⟨hal-02105265⟩

Publié le