{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:18:55Z","timestamp":1649031535976},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks and ISDN Systems"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1016\/0169-7552(89)90021-4","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:17:02Z","timestamp":1060283822000},"page":"29-36","source":"Crossref","is-referenced-by-count":0,"title":["Network constructing algorithm based on link significance evaluation: NABLE"],"prefix":"10.1016","volume":"17","author":[{"given":"Noriyuki","family":"Ikeuchi","sequence":"first","affiliation":[]},{"given":"Makoto","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0169-7552(89)90021-4_BIB1","series-title":"Proc. World Telecom Forum 79","first-page":"3.5.4","article-title":"The Change of the Cost Effective Network Hierarchy","author":"Sallai","year":"1979"},{"key":"10.1016\/0169-7552(89)90021-4_BIB2","series-title":"Proc. 9th ITC","first-page":"42","article-title":"On a Full Digital Long Distance Network","author":"Mazzei","year":"1979"},{"key":"10.1016\/0169-7552(89)90021-4_BIB3","article-title":"Minimum Cost Design for Circuit Switched Networks","author":"Knepley","year":"1973"},{"issue":"2","key":"10.1016\/0169-7552(89)90021-4_BIB4","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","article-title":"Depth-first Search and Linear Graph Algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0169-7552(89)90021-4_BIB5","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A Note on Two Problems in Connection with Graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numer. Math."},{"key":"10.1016\/0169-7552(89)90021-4_BIB6","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/net.3230120406","article-title":"An Efficient Algorithm for K Shortest Simple Paths","volume":"12","author":"Katoh","year":"1982","journal-title":"Networks"},{"issue":"2","key":"10.1016\/0169-7552(89)90021-4_BIB7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1002\/j.1538-7305.1954.tb03732.x","article-title":"Traffic Engineering Techniques for Determining Trunk Requirements in Alternate Routing Trunk Network","volume":"33","author":"Truitt","year":"1954","journal-title":"Bell System. Tech. J."}],"container-title":["Computer Networks and ISDN Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169755289900214?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169755289900214?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:21:14Z","timestamp":1552620074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169755289900214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["0169755289900214"],"URL":"https:\/\/doi.org\/10.1016\/0169-7552(89)90021-4","relation":{},"ISSN":["0169-7552"],"issn-type":[{"value":"0169-7552","type":"print"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}