{"id":"https://openalex.org/W2113946671","doi":"https://doi.org/10.1080/10637199408915409","title":"AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS","display_name":"AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2113946671","doi":"https://doi.org/10.1080/10637199408915409","mag":"2113946671"},"language":"en","primary_location":{"id":"doi:10.1080/10637199408915409","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915409","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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/A5101471636","display_name":"R. Lin","orcid":"https://orcid.org/0000-0001-8143-9477"},"institutions":[{"id":"https://openalex.org/I27559774","display_name":"SUNY Geneseo","ror":"https://ror.org/03g1q6c06","country_code":"US","type":"education","lineage":["https://openalex.org/I27559774"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. LIN","raw_affiliation_strings":["Department of Computer Science , SUNY at Geneseo , Geneseo, NY, 14454, USA","Department of Computer Science, SUNY at Geneseo, Geneseo, NY, 14454, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , SUNY at Geneseo , Geneseo, NY, 14454, USA","institution_ids":["https://openalex.org/I27559774"]},{"raw_affiliation_string":"Department of Computer Science, SUNY at Geneseo, Geneseo, NY, 14454, USA","institution_ids":["https://openalex.org/I27559774"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086528192","display_name":"Stephan Olariu","orcid":"https://orcid.org/0000-0002-3776-216X"},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. OLARIU","raw_affiliation_strings":["Department of Computer Science , Old Dominion University , Norfolk, VA, 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA, 23529-0162, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Old Dominion University , Norfolk, VA, 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA, 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109142529","display_name":"J.L. Schwing","orcid":null},"institutions":[{"id":"https://openalex.org/I81365321","display_name":"Old Dominion University","ror":"https://ror.org/04zjtrb98","country_code":"US","type":"education","lineage":["https://openalex.org/I81365321"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. L. SCHWING","raw_affiliation_strings":["Department of Computer Science , Old Dominion University , Norfolk, VA, 23529-0162, USA","Department of Computer Science, Old Dominion University, Norfolk, VA, 23529-0162, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Old Dominion University , Norfolk, VA, 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]},{"raw_affiliation_string":"Department of Computer Science, Old Dominion University, Norfolk, VA, 23529-0162, USA","institution_ids":["https://openalex.org/I81365321"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053111367","display_name":"jiachen zhang","orcid":"https://orcid.org/0009-0002-7952-7077"},"institutions":[{"id":"https://openalex.org/I65399651","display_name":"Elizabeth City State University","ror":"https://ror.org/02n5cs023","country_code":"US","type":"education","lineage":["https://openalex.org/I65399651"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. ZHANG","raw_affiliation_strings":["Department of Mathematics and Computer Science , Elizabeth City Stale University , Elizabeth City, NC, 27909, USA","Department of Mathematics and Computer Science, Elizabeth City Stale University, Elizabeth City, NC, 27909, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , Elizabeth City Stale University , Elizabeth City, NC, 27909, USA","institution_ids":["https://openalex.org/I65399651"]},{"raw_affiliation_string":"Department of Mathematics and Computer Science, Elizabeth City Stale University, Elizabeth City, NC, 27909, USA","institution_ids":["https://openalex.org/I65399651"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.868,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.76126491,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":"1-2","first_page":"99","last_page":"113"},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7222299575805664},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.673459529876709},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5524600148200989},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5435495376586914},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5199155211448669},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4810536205768585},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.47159087657928467},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4433619976043701},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4306778311729431},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39697253704071045},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38138672709465027}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7222299575805664},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.673459529876709},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5524600148200989},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5435495376586914},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5199155211448669},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4810536205768585},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.47159087657928467},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4433619976043701},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4306778311729431},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39697253704071045},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38138672709465027},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10637199408915409","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10637199408915409","pdf_url":null,"source":{"id":"https://openalex.org/S85375271","display_name":"International Journal of Parallel Emergent and Distributed Systems","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192","1744-5760","1744-5779"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and Applications","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":19,"referenced_works":["https://openalex.org/W202443341","https://openalex.org/W1484040084","https://openalex.org/W1512709563","https://openalex.org/W1523679426","https://openalex.org/W1608852523","https://openalex.org/W1965874601","https://openalex.org/W1990917344","https://openalex.org/W1995040285","https://openalex.org/W2011039300","https://openalex.org/W2013444956","https://openalex.org/W2015439916","https://openalex.org/W2028775537","https://openalex.org/W2034282023","https://openalex.org/W2037233409","https://openalex.org/W2038176627","https://openalex.org/W2075920437","https://openalex.org/W2078629151","https://openalex.org/W2081385108","https://openalex.org/W2132750992"],"related_works":["https://openalex.org/W4377371889","https://openalex.org/W2006803815","https://openalex.org/W4389362338","https://openalex.org/W1945279274","https://openalex.org/W2113623403","https://openalex.org/W2055932080","https://openalex.org/W1968512104","https://openalex.org/W2565109825","https://openalex.org/W1862126075","https://openalex.org/W78560857"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,14,30],"the":[3,9,16,66,83,89,106,113,116],"notoriously":[4],"difficult":[5],"problem":[6],"of":[7,12,18,34,68,96,115],"finding":[8,36],"minimum":[10,72,93],"number":[11,67],"paths":[13,69,90],"cover":[15,74,95],"vertices":[17],"a":[19,37,41,71,92],"graph":[20],"can":[21,44],"be":[22,45],"solved":[23,46],"efficiently":[24,47],"for":[25,31],"cographs.":[26],"Our":[27,108],"result":[28,109],"implies":[29],"this":[32],"class":[33],"graphs":[35],"hamiltonian":[38,42],"path":[39,73,94],"and":[40],"cycle":[43],"in":[48,70,75,82,91,98,105],"parallel.":[49],"Specifically,":[50],"with":[51],"an":[52],"n-vertcx":[53],"cograph":[54],"G":[55,97],"represented":[56],"by":[57],"its":[58],"parse":[59],"tree":[60],"as":[61],"input,":[62],"our":[63],"algorithm":[64],"determines":[65],"O(log":[76],"n)":[77,100],"time":[78],"using":[79,102],"n/log":[80],"nprocessors":[81],"EREW-PRAM;":[84],"we":[85],"also":[86],"exhibit":[87],"all":[88],"O(log2":[99],"lime":[101],"n/logn":[103],"processors":[104],"EREW-PRAM.":[107],"significantly":[110],"improves":[111],"on":[112],"state":[114],"art.":[117]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}