{"id":"https://openalex.org/W2052293722","doi":"https://doi.org/10.1145/2817460.2817501","title":"A graph for NP-complete problems","display_name":"A graph for NP-complete problems","publication_year":1997,"publication_date":"1997-01-01","ids":{"openalex":"https://openalex.org/W2052293722","doi":"https://doi.org/10.1145/2817460.2817501","mag":"2052293722"},"language":"en","primary_location":{"id":"doi:10.1145/2817460.2817501","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2817460.2817501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086096412","display_name":"G. Sampath","orcid":"https://orcid.org/0000-0002-3719-9098"},"institutions":[{"id":"https://openalex.org/I100633361","display_name":"University of Massachusetts Dartmouth","ror":"https://ror.org/00fzmm222","country_code":"US","type":"education","lineage":["https://openalex.org/I100633361"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Sampath","raw_affiliation_strings":["University of Massachusetts at Dartmouth, North Dartmouth, MA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts at Dartmouth, North Dartmouth, MA","institution_ids":["https://openalex.org/I100633361"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5086096412"],"corresponding_institution_ids":["https://openalex.org/I100633361"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1802248,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"167"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7341600656509399},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6173855662345886},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5303134322166443},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5150923132896423},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4789334237575531},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4647120237350464},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44877350330352783},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4477165937423706},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.41505166888237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23635628819465637}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7341600656509399},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6173855662345886},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5303134322166443},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5150923132896423},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4789334237575531},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4647120237350464},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44877350330352783},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4477165937423706},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.41505166888237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23635628819465637}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2817460.2817501","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2817460.2817501","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 35th Annual Southeast Regional Conference on - ACM-SE 35","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1977545325","https://openalex.org/W2003305391","https://openalex.org/W2086471530","https://openalex.org/W2753176400","https://openalex.org/W6992951189","https://openalex.org/W7037065903"],"related_works":["https://openalex.org/W3118505512","https://openalex.org/W2349797546","https://openalex.org/W191849398","https://openalex.org/W2359578922","https://openalex.org/W3190612612","https://openalex.org/W961142965","https://openalex.org/W2386416004","https://openalex.org/W2539729130","https://openalex.org/W4309397562","https://openalex.org/W4297793580"],"abstract_inverted_index":{"A":[0],"weighted":[1,96],"directed":[2,126],"graph":[3,91,97],"GQ":[4],"=":[5,99],"(V,":[6,100],"E)":[7],"is":[8,65,94,129,139,158,164,187],"defined":[9,66],"for":[10,135],"Q,":[11],"the":[12,34,42,45,50,56,68,88,95,103,109,121,132,167,180,190],"set":[13],"of":[14,36,44,52,58,71,92,105,112,120,182],"problems":[15],"known":[16],"to":[17,48,62,76,83,115,131,141,166,179,189],"be":[18,146],"NP-complete,":[19],"with":[20,102,148,155,170],"a":[21,53,72,153,161,175,183],"vertex":[22,177],"vi":[23],"in":[24,31,39,85],"V":[25],"being":[26,41,108],"an":[27,37,149,171],"NP-complete":[28,185],"problem":[29,59,63,124],"pi":[30],"Q":[32,93],"and":[33,169],"weight":[35,104],"edge":[38,106,163],"E":[40],"complexity":[43,57,70,90,111,157],"transformation":[46],"used":[47,140],"prove":[49],"NP-completeness":[51],"problem.":[54],"If":[55],"p1":[60,75,113],"relative":[61,89,114],"p2":[64,77],"as":[67],"minimum":[69,110],"reduction":[73,154],"from":[74,81],"(considering":[78],"all":[79],"paths":[80,138],"v1":[82],"v2":[84],"V)":[86],"then":[87],"GQR":[98,144],"E'),":[101],"e'ij":[107],"p2.":[116],"An":[117],"O(n3)":[118],"variant":[119],"shortest":[122,137],"path":[123],"on":[125],"graphs":[127],"that":[128],"similar":[130],"Floyd":[133],"algorithm":[134,151,173],"all-pairs":[136],"construct":[142],"GQR.":[143],"can":[145],"updated":[147],"O(n2)":[150],"when":[152],"smaller":[156],"found":[159],"or":[160],"new":[162,176,184],"added":[165,188],"graph,":[168],"O(n)":[172],"if":[174],"(corresponding":[178],"discovery":[181],"problem)":[186],"graph.":[191]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}