Abstract
A tropical polynomial is called $R$-polynomial if it can be realized as the minimum finishing time of a project network. $R$-polynomials satisfy the term extendability condition, and correspond to simple graphs. We give a characterization of $R$-polynomials in terms of simple graphs.
Citation
Takaaki ITO. "A characterization for tropical polynomials being the minimum finishing time of project networks." Hokkaido Math. J. 47 (3) 531 - 544, October 2018. https://doi.org/10.14492/hokmj/1537948829
Information
