{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T12:24:10Z","timestamp":1649161450675},"reference-count":16,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2017]]},"DOI":"10.1587\/transinf.2016fcp0005","type":"journal-article","created":{"date-parts":[[2017,2,28]],"date-time":"2017-02-28T19:58:25Z","timestamp":1488311905000},"page":"414-421","source":"Crossref","is-referenced-by-count":0,"title":["An Exact Algorithm for Lowest Edge Dominating Set"],"prefix":"10.1587","volume":"E100.D","author":[{"given":"Ken","family":"IWAIDE","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"NAGAMOCHI","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] D. Binkele-Raible and H. Fernau, \u201cParameterized Measure &amp; Conquer for Problems with No Small Kernels,\u201d Algorithmica, vol.64, no.1, pp.189-212, 2012.","DOI":"10.1007\/s00453-011-9566-6"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] H. Fernau, \u201cEdge Dominating Set: Efficient Enumeration-Based Exact Algorithms,\u201d In H. Bodlaender, M. Langston (eds.), IWPEC 2006. LNCS 4169, Springer-Verlag, pp.142-153, 2006.","DOI":"10.1007\/11847250_13"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] F.V. Fomin, S. Gaspers, S. Saurabh, and A.A. Stepanov, \u201cOn Two Techniques of Combining Branching and Treewidth,\u201d Algorithmica, vol.54, no.2, pp.181-207, 2009.","DOI":"10.1007\/s00453-007-9133-3"},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] T. Fujito and H. Nagamochi, \u201cA 2-Approximation Algorithm for the Minimum Weight Edge Dominating Set Problem,\u201d Discrete Applied Mathematics, vol.118, no.3, pp.199-207, 2002.","DOI":"10.1016\/S0166-218X(00)00383-8"},{"key":"5","unstructured":"[5] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to The Theory of NP-Completeness, Freeman, San Francisco, 1979."},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] F. Gavril, \u201cTesting for Equality Between Maximum Matching and Minimum Node Covering,\u201d Information Processing Letters, vol.6, no.6, pp.199-202, 1977.","DOI":"10.1016\/0020-0190(77)90068-0"},{"key":"7","doi-asserted-by":"crossref","unstructured":"[7] K. Iwaide and H. Nagamochi, \u201cAn Improved Algorithm for Parameterized Edge Dominating Set Problem,\u201d Journal of Graph Algorithms and Applications, vol.20, no.1, pp.23-58, 2016.","DOI":"10.7155\/jgaa.00383"},{"key":"8","doi-asserted-by":"crossref","unstructured":"[8] V. Raman, S. Saurabh, and S. Sikdar, \u201cEfficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques,\u201d Theory of Computing Systems, vol.42, no.3, pp.563-587, 2007.","DOI":"10.1007\/s00224-007-1334-2"},{"key":"9","unstructured":"[9] B. Randerath and I. Sciermeyer, \u201cExact Algorithms for Minimum Dominating Set,\u201d Technical Report zaik 2005-501, Universit\u00e4t zu K\u00f6ln, Cologne, Germany, 2005."},{"key":"10","doi-asserted-by":"crossref","unstructured":"[10] J.M.M. van Rooij and H.L. Bodlaender, \u201cExact Algorithms for Edge Domination,\u201d In M. Grohe, R. Niedermeier (eds.), IWPEC 2008. LNCS 5018, Springer-Verlag, pp.214-225, 2008.","DOI":"10.1007\/978-3-540-79723-4_20"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[11] V.V. Vazirani, \u201cA Theory of Alternating Paths and Blossoms for Proving Correctness of the <i>O<\/i>(\u221a<i>VE<\/i>) General Graph Maximum Matching Algorithm,\u201d Combinatorica, vol.14, no.1, pp.71-109, 1994.","DOI":"10.1007\/BF01305952"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[12] M. Xiao, T. Kloks, and S.-H. Poon, \u201cNew Parameterized Algorithms for the Edge Dominating Set Problem,\u201d Theoretical Computer Science, vol.511, pp.147-158, 2013.","DOI":"10.1016\/j.tcs.2012.06.022"},{"key":"13","doi-asserted-by":"crossref","unstructured":"[13] M. Xiao and H. Nagamochi, \u201cParameterized Edge Dominating Set in Cubic Graphs,\u201d In M. Atallah, X.-Y. Li, B. Zhu (eds.), FAW-AAIM 2011. LNCS 6681, Springer-Verlag, pp.100-112, 2011.","DOI":"10.1007\/978-3-642-21204-8_14"},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] M. Xiao and H. Nagamochi, \u201cA Refined Exact Algorithm for Edge Dominating Set,\u201d In A. Manindra, S. Barry, L. Angsheng (eds.), TAMC 2012. LNCS 7287, Springer-Verlag, pp.360-372, 2012","DOI":"10.1007\/978-3-642-29952-0_36"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[15] M. Xiao and H. Nagamochi, \u201cExact Algorithms for Annotated Edge Dominating Set in Graphs with Degree Bounded by 3,\u201d IEICE Trans. Inf. &amp; Syst., vol.E96-D, no.3, pp.408-418, 2013.","DOI":"10.1587\/transinf.E96.D.408"},{"key":"16","doi-asserted-by":"crossref","unstructured":"[16] M. Yanakakis and F. Gavril, \u201cEdge Dominating Set in Graphs,\u201d SIAM J. Appl. Math., vol.38, no.3, pp.364-372, 1980.","DOI":"10.1137\/0138030"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0005\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T07:36:02Z","timestamp":1498376162000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E100.D\/3\/E100.D_2016FCP0005\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2016fcp0005","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}