{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T19:34:22Z","timestamp":1725824062083},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319213972"},{"type":"electronic","value":"9783319213989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_42","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"537-547","source":"Crossref","is-referenced-by-count":4,"title":["On the Complete Width and Edge Clique Cover Problems"],"prefix":"10.1007","author":[{"given":"Van Bang","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Lung","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"key":"42_CR1","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0012-365X(93)90477-B","volume":"115","author":"Z Bl\u00e1zsik","year":"1993","unstructured":"Bl\u00e1zsik, Z., Hujter, M., Pluh\u00e1r, A., Tuza, Z.: Graphs with no induced \n                      \n                        \n                      \n                      $$C_4$$\n                      \n                        \n                          \n                            C\n                            4\n                          \n                        \n                      \n                     and \n                      \n                        \n                      \n                      $$2K_2$$\n                      \n                        \n                          \n                            2\n                            \n                              K\n                              2\n                            \n                          \n                        \n                      \n                    . Discrete Mathematics 115, 51\u201355 (1993)","journal-title":"Discrete Mathematics"},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"42_CR3","unstructured":"Chandler, D.B., Chang, M.-S., Kloks, T., Peng, S.-L.: Probe Graphs, (2009). \n                      http:\/\/www.cs.ccu.edu.tw\/~hunglc\/ProbeGraphs.pdf"},{"key":"42_CR4","doi-asserted-by":"publisher","first-page":"2496","DOI":"10.1016\/j.tcs.2010.10.041","volume":"412","author":"M-S Chang","year":"2011","unstructured":"Chang, M.-S., Hung, L.-J., Kloks, T., Peng, S.-L.: Block-graph width. Theoretical Computer Science 412, 2496\u20132502 (2011)","journal-title":"Theoretical Computer Science"},{"key":"42_CR5","unstructured":"Chang, M.-S., Kloks, T., Liu, C.-H.: Edge-clique graphs of cocktail parties have unbounded rankwidth, (2012). \n                      arXiv:1205.2483\n                      \n                     [cs.DM]"},{"key":"42_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-45477-2_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M-S Chang","year":"2001","unstructured":"Chang, M.-S., M\u00fcller, H.: On the tree-degree of graphs. In: Brandst\u00e4dt, A., Le, V.B. (eds.) WG 2001. LNCS, vol. 2204, pp. 44\u201354. Springer, Heidelberg (2001)"},{"key":"42_CR7","first-page":"151","volume":"36","author":"S Ma","year":"1989","unstructured":"Ma, S., Wallis, W.D., Wu, J.: Clique covering of chordal graphs. Utilitas Mathematica 36, 151\u2013152 (1989)","journal-title":"Utilitas Mathematica"},{"key":"42_CR8","unstructured":"Cygan, M., Pilipczuky, M., Pilipczuk, M.: Known algorithms for EDGE CLIQUE COVER are probably optimal. In: Proc. SODA, 1044\u20131053 (2013)"},{"key":"42_CR9","unstructured":"Foldes, S., Hammer, P.L.: Split graphs. Congressus Numerantium, No. XIX, 311\u2013315 (1977)"},{"key":"42_CR10","series-title":"Annals of Discrete Math.","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Math., vol. 57, 2nd edn. Elsevier, Amsterdam (2004)","edition":"2"},{"key":"42_CR11","doi-asserted-by":"crossref","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM Journal of Experimental Algorithmics 13 (2008). Article 2.2","DOI":"10.1145\/1412228.1412236"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0166-218X(90)90092-Q","volume":"28","author":"PL Hammer","year":"1990","unstructured":"Hammer, P.L., Peled, U.N., Sun, X.: Difference graphs. Discrete Applied Mathematics 28, 35\u201344 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR13","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"4","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal on Computing 4, 713\u2013717 (1981)","journal-title":"SIAM Journal on Computing"},{"key":"42_CR14","first-page":"187","volume":"11","author":"DN Hoover","year":"1992","unstructured":"Hoover, D.N.: Complexity of graph covering problems for graphs of low degree. Journal of Combinatorial Mathematics and Combinatorial Computing 11, 187\u2013208 (1992)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"42_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(91)90165-E","volume":"40","author":"W-L Hsu","year":"1991","unstructured":"Hsu, W.-L., Tsai, K.-H.: Linear time algorithms on circular-arc graphs. Inf. Process. Lett. 40, 123\u2013129 (1991)","journal-title":"Inf. Process. Lett."},{"key":"42_CR16","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/359340.359346","volume":"21","author":"LT Kou","year":"1978","unstructured":"Kou, L.T., Stockmeyer, L.J., Wong, C.K.: Covering edges by cliques with regard to keyword conflicts and intersection graphs. Comm. ACM 21, 135\u2013139 (1978)","journal-title":"Comm. ACM"},{"key":"42_CR17","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2014.12.014","volume":"568","author":"VB Le","year":"2015","unstructured":"Le, V.B., Peng, S.-L.: Characterizing and recognizing probe block graphs. Theoretical Computer Science 568, 97\u2013102 (2015)","journal-title":"Theoretical Computer Science"},{"key":"42_CR18","doi-asserted-by":"publisher","unstructured":"Le, V.B., Peng, S.-L.: Good characterizations and linear time recognition for 2-probe block graphs. In: Proceedings of the International Computer Symposium, Taichung, Taiwan, December 12\u201314, 2014, pp. 22\u201331. IOS Press (2015). doi:\n                      10.3233\/978-1-61499-484-8-22","DOI":"10.3233\/978-1-61499-484-8-22"},{"key":"42_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0166-218X(94)00022-0","volume":"52","author":"F Maffray","year":"1994","unstructured":"Maffray, F., Preissmann, M.: Linear recognition of pseudo-split graphs. Discrete Applied Mathematics 52, 307\u2013312 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"42_CR20","series-title":"Annals of discrete mathematics","volume-title":"Threshold Graphs and Related Topics","author":"NVR Mahadev","year":"1995","unstructured":"Mahadev, N.V.R., Peled, U.N.: Threshold Graphs and Related Topics. Annals of discrete mathematics, vol. 56. Elsevier, Amsterdam (1995)"},{"key":"42_CR21","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","volume":"149","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: On edge perfectness and classes of bipartite graphs. Discrete Math. 149, 159\u2013187 (1996)","journal-title":"Discrete Math."},{"key":"42_CR22","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/1385-7258(77)90055-5","volume":"80","author":"J Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. Indagationes Mathematicae 80, 406\u2013424 (1977)","journal-title":"Indagationes Mathematicae"},{"key":"42_CR23","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1137\/0213005","volume":"13","author":"NJ Pullman","year":"1984","unstructured":"Pullman, N.J.: Clique covering of graphs IV. Algorithms. SIAM Journal on Computing 13, 57\u201375 (1984)","journal-title":"Algorithms. SIAM Journal on Computing"},{"key":"42_CR24","first-page":"197","volume":"67","author":"A Raychaudhuri","year":"1988","unstructured":"Raychaudhuri, A.: Intersection number and edge clique graphs of chordal and strongly chordal graphs. Congressus Numer. 67, 197\u2013204 (1988)","journal-title":"Congressus Numer."},{"key":"42_CR25","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1137\/0210022","volume":"10","author":"M Yannakakis","year":"1981","unstructured":"Yannakakis, M.: Node-delection problems on bipartite graphs. SIAM Journal on Computing 10, 310\u2013327 (1981)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_42","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T04:05:38Z","timestamp":1559189138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}