@article{dmtcs:2749,
    title      = {A max-flow algorithm for positivity of Littlewood-Richardson coefficients},
    author     = {Peter Bürgisser and Christian Ikenmeyer},
    url        = {https://dmtcs.episciences.org/2749},
    doi        = {10.46298/dmtcs.2749},
    journal    = {Discrete Mathematics \& Theoretical Computer Science},
    issn       = {1365-8050},
    volume     = {DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)},
    issuetitle = {Proceedings},
    eid        = 7,
    year       = {2009},
    month      = {Jan},
    keywords   = {Littlewood-Richardson coefficients, saturation conjecture, flows in network, polynomial time, [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]},
    language   = {English},
}