{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:39:51Z","timestamp":1648859991528},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2016]]},"DOI":"10.1587\/transinf.2016edp7221","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T22:14:46Z","timestamp":1480544086000},"page":"3047-3052","source":"Crossref","is-referenced-by-count":0,"title":["Computing K-Terminal Reliability of Circular-Arc 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.O. Ball and J.S. Provan, \u201cDisjoint products and efficient computation of reliability,\u201d Operations Res., vol.36, no.5, pp.703-715, 1988.","DOI":"10.1287\/opre.36.5.703"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] 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"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] 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":"5","doi-asserted-by":"crossref","unstructured":"[5] 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":"6","doi-asserted-by":"crossref","unstructured":"[6] C.-M. Chen and M.-S. Lin, \u201cComputing Terminal Reliability of Multi-tolerance Graphs,\u201d IEICE Trans. Inf. &amp; Syst., vol.E99-D, no.7, pp.1733-1741, 2016.","DOI":"10.1587\/transinf.2015EDP7418"},{"key":"7","unstructured":"[7] E.M. Eschen and J.P. Spinrad, \u201cAn O(n<sup>2<\/sup>) algorithm for circular-arc graph recognition,\u201d Proc. Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.128-137, 1993."},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 2004.","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] T. Kloks, D. Kratsch, and C.K. Wong, \u201cMinimum fill-in on circle and circular-arc graphs,\u201d Journal of Algorithms, vol.28, no.2, pp.272-289, 1998.","DOI":"10.1006\/jagm.1998.0936"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] 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":"11","unstructured":"[11] M.S. Lin and C.M. Chen, \u201cComputing the K-terminal Reliability of Circle Graphs,\u201d arXiv preprint arXiv:1610.04544, 2016."},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] 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":"13","doi-asserted-by":"crossref","unstructured":"[13] 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":"14","doi-asserted-by":"crossref","unstructured":"[14] 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"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/12\/E99.D_2016EDP7221\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,16]],"date-time":"2019-09-16T03:56:25Z","timestamp":1568606185000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E99.D\/12\/E99.D_2016EDP7221\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2016]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016edp7221","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}