{"id":"https://openalex.org/W1964480235","doi":"https://doi.org/10.1142/s0129626402000823","title":"PARALLEL ALGORITHMS FOR HAMILTONIAN 2-SEPARATOR CHORDAL GRAPHS","display_name":"PARALLEL ALGORITHMS FOR HAMILTONIAN 2-SEPARATOR CHORDAL GRAPHS","publication_year":2002,"publication_date":"2002-03-01","ids":{"openalex":"https://openalex.org/W1964480235","doi":"https://doi.org/10.1142/s0129626402000823","mag":"1964480235"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626402000823","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402000823","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5061095539","display_name":"B. S. Panda","orcid":"https://orcid.org/0000-0002-0721-5325"},"institutions":[{"id":"https://openalex.org/I36893310","display_name":"University of Hyderabad","ror":"https://ror.org/04a7rxb17","country_code":"IN","type":"education","lineage":["https://openalex.org/I36893310"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"B. S. PANDA","raw_affiliation_strings":["Department of Computer and Information Sciences, University of Hyderabad, Hyderabad - 500 046, India","Department of Computer and Information Sciences , University of Hyderabad , Hyderabad , 500 046 , India"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Sciences, University of Hyderabad, Hyderabad - 500 046, India","institution_ids":["https://openalex.org/I36893310"]},{"raw_affiliation_string":"Department of Computer and Information Sciences , University of Hyderabad , Hyderabad , 500 046 , India","institution_ids":["https://openalex.org/I36893310"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083989376","display_name":"Vijay Natarajan","orcid":"https://orcid.org/0000-0002-7956-1470"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"VIJAY NATARAJAN","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050881965","display_name":"Sajal K. Das","orcid":"https://orcid.org/0000-0002-9471-0868"},"institutions":[{"id":"https://openalex.org/I189196454","display_name":"The University of Texas at Arlington","ror":"https://ror.org/019kgqr73","country_code":"US","type":"education","lineage":["https://openalex.org/I189196454"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"SAJAL K. DAS","raw_affiliation_strings":["Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019-0015, USA","Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019-0015, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019-0015, USA","institution_ids":["https://openalex.org/I189196454"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX 76019-0015, USA#TAB#","institution_ids":["https://openalex.org/I189196454"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061095539"],"corresponding_institution_ids":["https://openalex.org/I36893310"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10054518,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"12","issue":"01","first_page":"51","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T13664","display_name":"Genome Rearrangement Algorithms","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1311","display_name":"Genetics"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9916999936103821,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7112345099449158},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6458867788314819},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6126304268836975},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5661977529525757},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48741772770881653},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4845361113548279},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.46293964982032776},{"id":"https://openalex.org/keywords/outerplanar-graph","display_name":"Outerplanar graph","score":0.4583645761013031},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.45630353689193726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4271514415740967},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3936210572719574},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35215869545936584},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.22788086533546448},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13886260986328125}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7112345099449158},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6458867788314819},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6126304268836975},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5661977529525757},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48741772770881653},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4845361113548279},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.46293964982032776},{"id":"https://openalex.org/C125792925","wikidata":"https://www.wikidata.org/wiki/Q3115604","display_name":"Outerplanar graph","level":5,"score":0.4583645761013031},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.45630353689193726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4271514415740967},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3936210572719574},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35215869545936584},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.22788086533546448},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13886260986328125},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626402000823","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626402000823","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/W1569899959","https://openalex.org/W1978583881","https://openalex.org/W1995040285","https://openalex.org/W2063733383","https://openalex.org/W2069446854","https://openalex.org/W2105038716","https://openalex.org/W2163178194"],"related_works":["https://openalex.org/W311575298","https://openalex.org/W2099914933","https://openalex.org/W1968285535","https://openalex.org/W3006001508","https://openalex.org/W1839817955","https://openalex.org/W2170912089","https://openalex.org/W1480459784","https://openalex.org/W3199257895","https://openalex.org/W2962922671","https://openalex.org/W1546403474","https://openalex.org/W3098933002","https://openalex.org/W1492613353","https://openalex.org/W2885131583","https://openalex.org/W2061944694","https://openalex.org/W2048197731","https://openalex.org/W2131735508","https://openalex.org/W2003142262","https://openalex.org/W1578113210","https://openalex.org/W2066108505","https://openalex.org/W2051385809"],"abstract_inverted_index":{"In":[0],"this":[1],"paper":[2],"we":[3],"propose":[4,54],"a":[5,10,15,66,71],"parallel":[6,55],"algorithm":[7,21],"to":[8,57,64],"construct":[9,65],"one-sided":[11],"monotone":[12],"polygon":[13],"from":[14],"Hamiltonian":[16,59,67],"2-separator":[17,60],"chordal":[18,61],"graph.":[19,51,72],"The":[20],"requires":[22],"O(":[23,76,90],"log":[24,77,91],"n)":[25,79,93],"time":[26,80,94],"and":[27,42,63,89],"O(n)":[28],"processors":[29,83,97],"on":[30,84,98],"the":[31,38,45,50,85,99],"CREW":[32,100],"PRAM":[33,87,101],"model,":[34,102],"where":[35],"n":[36],"is":[37,44],"number":[39,46],"of":[40,47],"vertices":[41],"m":[43],"edges":[48],"in":[49,69,75],"We":[52],"also":[53],"algorithms":[56],"recognize":[58],"graphs":[62],"cycle":[68],"such":[70],"They":[73],"run":[74],"2":[78,92],"using":[81,95],"O(mn)":[82],"CRCW":[86],"model":[88],"O(m)":[96],"respectively.":[103]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}