{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:14:49Z","timestamp":1750306489833,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":6,"publisher":"ACM Press","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1145\/2817460.2817501","type":"proceedings-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T16:48:13Z","timestamp":1440607693000},"page":"165-167","source":"Crossref","is-referenced-by-count":0,"title":["A graph for NP-complete problems"],"prefix":"10.1145","author":[{"given":"G.","family":"Sampath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/2817460.2817501-1","unstructured":"A. Aho, J. D. Ullman and J. E. Hopcroft. Data Structures and Algorithms. Addison-Wesley, Reading (Mass.), 1982."},{"key":"key-10.1145\/2817460.2817501-2","unstructured":"A. Aho and J. E. Hopcroft. Design and Analysis of Algorithms. Addison-Wesley, Reading (Mass.), 1974."},{"key":"key-10.1145\/2817460.2817501-3","unstructured":"R. K. Ahuja, T. L. Magnanti and J. B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice-Hall, Englewood-Cliffs (NJ), 1993."},{"key":"key-10.1145\/2817460.2817501-4","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability. Freeman, San Francisco, 1979."},{"key":"key-10.1145\/2817460.2817501-5","doi-asserted-by":"crossref","unstructured":"B. J. Lageweg, J. K. Lenstra, E. L. Lawler, and A. H. G. Rinnooy Kan, \"Computer-aided complexity classification of combinatorial problems. Communs. of the ACM 25 (November 1982), 817--822.","DOI":"10.1145\/358690.363066"},{"key":"key-10.1145\/2817460.2817501-6","doi-asserted-by":"crossref","unstructured":"R. E. Stearns. \"It's time to reconsider time.\" Turing Award Lecture, Communs. of the ACM 37 (November 1994), 95--99.","DOI":"10.1145\/188280.188379"}],"event":{"name":"the 35th Annual Southeast Regional Conference","start":{"date-parts":[[1997,4,2]]},"number":"35","location":"Murfreesboro, Tennessee","end":{"date-parts":[[1997,4,4]]},"acronym":"ACM-SE 35"},"container-title":["Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2817460.2817501","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=2817501&ftid=1616138&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:34Z","timestamp":1750225714000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=2817460.2817501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":6,"URL":"https:\/\/doi.org\/10.1145\/2817460.2817501","relation":{},"subject":[],"published":{"date-parts":[[1997]]}}}