{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:11:17Z","timestamp":1773720677553,"version":"3.50.1"},"reference-count":10,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11971,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a finite family of non\u2010empty sets. The intersection graph of this family is obtained by representing each set by a vertex, two vertices being connected by an edge if and only if the corresponding sets intersect. The intersection graph of a family of arcs on a circularly ordered set is called a circular\u2010arc graph. In this paper we give a characterization of the circular\u2010arc graph and we describe efficient algorithms for recognizing two subclasses. Also, we describe efficient algorithms for finding a maximum independent set, a minimum covering by cliques and a maximum clique of a circular\u2010arc graph.<\/jats:p>","DOI":"10.1002\/net.3230040407","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T02:16:47Z","timestamp":1178849807000},"page":"357-369","source":"Crossref","is-referenced-by-count":116,"title":["Algorithms on circular\u2010arc graphs"],"prefix":"10.1002","volume":"4","author":[{"given":"F.","family":"Gavril","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1964-055-5"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.4064\/fm-51-1-45-64"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1965.15.835"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1137\/0201013"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1959.5222697"},{"key":"e_1_2_1_8_2","first-page":"54","volume-title":"Combinatorial Geometry in the Plane","author":"Hadwiger H.","year":"1964"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.2307\/2317880"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1971.39.535"},{"key":"e_1_2_1_11_2","unstructured":"Desler J. F.andS. L.Hakimi \u201cOn Finding a Maximum Independent Stable Set of a Graph \u201d Proc. of Fourth Annual Princeton Conference on Information Sciences and Systems Princeton New Jersey 1970."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230040407","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230040407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:08:02Z","timestamp":1699798082000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230040407"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1002\/net.3230040407"],"URL":"https:\/\/doi.org\/10.1002\/net.3230040407","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,1]]}}}