{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T07:46:14Z","timestamp":1649058374892},"reference-count":19,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2015edp7418","type":"journal-article","created":{"date-parts":[[2016,6,30]],"date-time":"2016-06-30T23:09:06Z","timestamp":1467328146000},"page":"1733-1741","source":"Crossref","is-referenced-by-count":1,"title":["Computing Terminal Reliability of Multi-Tolerance Graphs"],"prefix":"10.1587","volume":"E99.D","author":[{"given":"Chien-Min","family":"CHEN","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, National Taipei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min-Sheng","family":"LIN","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, National Taipei University of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] H.M. AboElFotoh and C.J. Colbourn, \u201cEfficient algorithms for computing the reliability of permutation and interval graphs,\u201d Networks, vol.20, no.7, pp.883-898, 1990.","DOI":"10.1002\/net.3230200706"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] M.-S. Lin, \u201cA linear-time algorithm for computing K-terminal reliability on proper interval graphs,\u201d IEEE Trans. Rel., vol.51, no.1, pp.58-62, 2002.","DOI":"10.1109\/24.994911"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] M.-S. Lin and C.-C. Ting, \u201cComputing K-terminal reliability of d-trapezoid graphs,\u201d Information Processing Letters, vol.113, no.19, pp.734-738, 2013.","DOI":"10.1016\/j.ipl.2013.07.006"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] H.M. AboElFotoh and C.J. Colbourn, \u201cComputing 2-terminal reliability for radio-broadcast networks,\u201d IEEE Trans. Rel., vol.38, no.5, pp.538-555, 1989.","DOI":"10.1109\/24.46478"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[5] C.-C. Ting and M.-S. Lin, \u201cComputing 2-Terminal Reliability of Probe Interval Graphs,\u201d Applied Mathematical Sciences, vol.9, no.9, pp.419-427, 2015.","DOI":"10.12988\/ams.2015.410883"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L.G. Valiant, \u201cThe complexity of enumeration and reliability problems,\u201d SIAM Journal on Computing, vol.8, no.3, pp.410-421, 1979.","DOI":"10.1137\/0208032"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 2004.","DOI":"10.1016\/S0167-5060(04)80059-1"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] F.R. McMorris, C. Wang, and P. Zhang, \u201cOn probe interval graphs,\u201d Discrete Applied Mathematics, vol.88, no.1, pp.315-324, 1998.","DOI":"10.1016\/S0166-218X(98)00077-8"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] I. Dagan, M.C. Golumbic, and R.Y. Pinter, \u201cTrapezoid graphs and their coloring,\u201d Discrete Applied Mathematics, vol.21, no.1, pp.35-46, 1988.","DOI":"10.1016\/0166-218X(88)90032-7"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] C. Flotow, \u201cOn powers of m-trapezoid graphs,\u201d Discrete Applied Mathematics, vol.63, no.2, pp.187-192, 1995.","DOI":"10.1016\/0166-218X(95)00062-V"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] M.C. Golumbic and A.N. Trenk, \u201cTolerance graphs,\u201d Cambridge University Press, 2004.","DOI":"10.1017\/CBO9780511542985"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] K.P. Bogart, P.C. Fishburn, G. Isaak, and L. Langley, \u201cProper and unit tolerance graphs,\u201d Discrete Applied Mathematics, vol.60, no.1, pp.99-117, 1995.","DOI":"10.1016\/0166-218X(94)00044-E"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] A. Parra, \u201cTriangulating multitolerance graphs,\u201d Discrete Applied Mathematics, vol.84, no.1, pp.183-197, 1998.","DOI":"10.1016\/S0166-218X(98)00026-2"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] G.B. Mertzios, \u201cAn intersection model for multitolerance graphs: Efficient algorithms and hierarchy,\u201d Algorithmica, vol.69, no.3, pp.540-581, 2014.","DOI":"10.1007\/s00453-012-9743-2"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] H.L. Bodlaender, T. Kloks, and D. Kratsch, \u201cTreewidth and pathwidth of permutation graphs,\u201d SIAM Journal on Discrete Mathematics, vol.8, no.4, pp.606-616, 1995.","DOI":"10.1137\/S089548019223992X"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] H.L. Bodlaender, T. Kloks, D. Kratsch, and H. M\u00fcller, \u201cTreewidth and minimum fill-in on d-trapezoid graphs,\u201d Journal of Graph Algorithms and Applications, vol.2, no.5, pp.1-23, 1998.","DOI":"10.7155\/jgaa.00008"},{"key":"17","doi-asserted-by":"crossref","unstructured":"[17] M.O. Ball and J.S. Provan, \u201cDisjoint products and efficient computation of reliability,\u201d Operations Research, vol.36, no.5, pp.703-715, 1988.","DOI":"10.1287\/opre.36.5.703"},{"key":"18","unstructured":"[18] M.S. Lin, \u201cAn efficient algorithm for computing the reliability of stochastic binary systems,\u201d IEICE Trans. Inf. & Syst., vol.E87-D, no.3, pp.745-750, 2004."},{"key":"19","doi-asserted-by":"crossref","unstructured":"[19] M.O. Ball, J.S. Provan, and D.R. Shier, \u201cReliability covering problems,\u201d Networks, vol.21, no.3, pp.345-357, 1991.","DOI":"10.1002\/net.3230210306"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/7\/E99.D_2015EDP7418\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T13:32:06Z","timestamp":1568122326000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/7\/E99.D_2015EDP7418\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":19,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2015edp7418","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}