{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T18:57:16Z","timestamp":1648839436404},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,3,1]],"date-time":"2016-03-01T00:00:00Z","timestamp":1456790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Faculty of Computer Science and Engineering"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1109\/tr.2015.2420042","type":"journal-article","created":{"date-parts":[[2015,4,13]],"date-time":"2015-04-13T18:47:20Z","timestamp":1428950840000},"page":"282-290","source":"Crossref","is-referenced-by-count":1,"title":["Maximal Level Minimal Path Vectors of a Two-Terminal Undirected Network"],"prefix":"10.1109","volume":"65","author":[{"given":"Marija","family":"Mihova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasha","family":"Stojkovikj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mile","family":"Jovanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emil","family":"Stankov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/24.257817"},{"key":"ref11","article-title":"Graph algorithms","author":"kamil","year":"2003","journal-title":"CS61B"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276714"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250306"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00039-3"},{"key":"ref15","first-page":"437","article-title":"Estimation of minimal path vectors of multi state two terminal networks with cycles control","volume":"25","author":"mihova","year":"2011","journal-title":"Mathematica"},{"key":"ref16","first-page":"133","article-title":"On maximal level minimal path vectors of a two-terminal network","volume":"8","author":"mihova","year":"2014","journal-title":"Int J Olympiads Informat IOI"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120902"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0212053"},{"key":"ref19","article-title":"Alternative approach for analyzing multistate network reliability","author":"ramirez-marquez","year":"2003","journal-title":"Proc Industrial Engineering Research Conf (IERC)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973020.6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230250207"},{"key":"ref6","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref5","article-title":"Counting minimum (s, t)-cuts in weighted planar graphs in polynomial time","author":"bezakova","year":"2010","journal-title":"Proc 35th Int Symp MFCS 2010"},{"key":"ref8","article-title":"A simple algorithm to find all minimal path vectors to demand level d in a stochastic-flow network","author":"forghani-elahabadi","year":"2013","journal-title":"Proc 5th Iranian Conf Applied Mathematics"},{"key":"ref7","article-title":"Algorithms","author":"erickson","year":"2009"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1982.5221290"},{"key":"ref1","article-title":"Models for planning the evolution of local telecommunication networks","author":"balakrishnan","year":"1989"},{"key":"ref9","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"ref20","article-title":"Multi-state two-terminal reliability: A generalized cut-set approach","author":"ramirez-marquez","year":"2003","journal-title":"Rutgers Univ IE Working Paper"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1142\/9789812703378_fmatter"},{"key":"ref21","article-title":"Computing the minimum cut and maximum flow of undirected graphs","author":"schroeder","year":"2004","journal-title":"Relat\ufffdrioT\ufffdcnico RT-DINF 003\/2004"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/7422884\/07084693.pdf?arnumber=7084693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:48:44Z","timestamp":1642006124000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7084693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3]]},"references-count":22,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2015.2420042","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"value":"0018-9529","type":"print"},{"value":"1558-1721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3]]}}}