A characterization for tropical polynomials being the minimum finishing time of project networks

DOI10.14492/HOKMJ/1537948829zbMath1414.05228OpenAlexW2892854764WikidataQ129189025 ScholiaQ129189025MaRDI QIDQ1797241

Takaaki Ito

Publication date: 19 October 2018

Published in: Hokkaido Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14492/hokmj/1537948829

zbMATH Keywords

discrete event systemtropical algebra

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Max-plus and related algebras (15A80)

This page was built for publication: A characterization for tropical polynomials being the minimum finishing time of project networks