{"title":"热带多项式的表征是项目网络的最小完成时间","authors":"Takaaki Ito","doi":"10.14492/hokmj/1537948829","DOIUrl":null,"url":null,"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.","PeriodicalId":55051,"journal":{"name":"Hokkaido Mathematical Journal","volume":" ","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A characterization for tropical polynomials being the minimum finishing time of project networks\",\"authors\":\"Takaaki Ito\",\"doi\":\"10.14492/hokmj/1537948829\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":55051,\"journal\":{\"name\":\"Hokkaido Mathematical Journal\",\"volume\":\" \",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Hokkaido Mathematical Journal\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.14492/hokmj/1537948829\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hokkaido Mathematical Journal","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.14492/hokmj/1537948829","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
A characterization for tropical polynomials being the minimum finishing time of project networks
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.
期刊介绍：
The main purpose of Hokkaido Mathematical Journal is to promote research activities in pure and applied mathematics by publishing original research papers. Selection for publication is on the basis of reports from specialist referees commissioned by the editors.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
