{"id":"https://openalex.org/W2124526408","doi":"https://doi.org/10.1109/sfcs.1988.21933","title":"Efficient parallel algorithms for chordal graphs","display_name":"Efficient parallel algorithms for chordal graphs","alternate_titles":[],"publication_year":1988,"publication_date":"1988-01-01","ids":{"openalex":"https://openalex.org/W2124526408","doi":"https://doi.org/10.1109/sfcs.1988.21933","mag":"2124526408"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.1988.21933","doi":"https://doi.org/10.1109/sfcs.1988.21933","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1988.21933","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2124526408"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5035567880","display_name":"Philip N. Klein","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"P.N. Klein","raw_affiliation_strings":["Harvard University, USA","HARVARD Univ., Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University, USA","institution_ids":["https://openalex.org/I136199984"]},{"raw_affiliation_string":"HARVARD Univ., Cambridge, MA, USA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035567880"],"corresponding_institution_ids":["https://openalex.org/I136199984"],"apc_list":null,"apc_paid":null,"fwci":5.7554,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.96911197,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":null,"issue":null,"first_page":"150","last_page":"161"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.8817999958992004,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.8817999958992004,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.11249999701976776,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.003700000001117587,"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-graphs","display_name":"chordal graphs","score":0.9860000014305115},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.9940000176429749},{"id":"https://openalex.org/keywords/perfect-elimination-orderings","display_name":"perfect elimination orderings","score":0.8560000061988831},{"id":"https://openalex.org/keywords/maximum-clique-problem","display_name":"maximum clique problem","score":0.8360000252723694},{"id":"https://openalex.org/keywords/maximum-independent-set-problem","display_name":"maximum independent set","score":0.9980000257492065},{"id":"https://openalex.org/keywords/graph-coloring","display_name":"graph coloring","score":0.9290000200271606},{"id":"https://openalex.org/keywords/interval-graphs","display_name":"interval graphs","score":0.8130000233650208},{"id":"https://openalex.org/keywords/graph-isomorphism-testing","display_name":"graph isomorphism testing","score":0.8960000276565552},{"id":"https://openalex.org/keywords/breadth-first-search","display_name":"breadth-first search","score":0.8399999737739563},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":0.8650000095367432},{"id":"https://openalex.org/keywords/graph-recognition","display_name":"graph recognition","score":0.8560000061988831}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.9228532314300537},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.898737370967865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5710654854774475},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.5626041293144226},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5590069890022278},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5228988528251648},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5056164264678955},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4652925729751587},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4419030249118805},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4363862872123718},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41532212495803833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39806637167930603},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3840321898460388},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3524662256240845},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34067773818969727},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16377028822898865},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.11013829708099365}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/sfcs.1988.21933","doi":"https://doi.org/10.1109/sfcs.1988.21933","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.1988.21933","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.128.7424","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~pnk/publications/1996chordal.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.18.969","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~pnk/chordal.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.186.4400","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.186.4400","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/research/pubs/pdfs/1996/Klein-1996-EPA.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W125961860","https://openalex.org/W642072751","https://openalex.org/W1495059240","https://openalex.org/W1530753374","https://openalex.org/W1537547867","https://openalex.org/W1655990431","https://openalex.org/W1973310391","https://openalex.org/W2004350101","https://openalex.org/W2013444956","https://openalex.org/W2023154896","https://openalex.org/W2024491681","https://openalex.org/W2035331304","https://openalex.org/W2037106315","https://openalex.org/W2039166024","https://openalex.org/W2046461289","https://openalex.org/W2063410295","https://openalex.org/W2074456731","https://openalex.org/W2080063509","https://openalex.org/W2086119402","https://openalex.org/W2089081330","https://openalex.org/W2089465933","https://openalex.org/W2089898547","https://openalex.org/W2110140952","https://openalex.org/W2123350362","https://openalex.org/W2134008688","https://openalex.org/W2141173730","https://openalex.org/W2143462372","https://openalex.org/W2148417962","https://openalex.org/W2149410722","https://openalex.org/W2320198223","https://openalex.org/W2343730655","https://openalex.org/W3145802425","https://openalex.org/W4250871362","https://openalex.org/W6998472843","https://openalex.org/W7009821190"],"related_works":["https://openalex.org/W2072122885","https://openalex.org/W2241564361","https://openalex.org/W1541948205","https://openalex.org/W7095663255","https://openalex.org/W2053160526","https://openalex.org/W1968285535","https://openalex.org/W143358188","https://openalex.org/W1594142629","https://openalex.org/W2272336114","https://openalex.org/W1978587016"],"abstract_inverted_index":{"The":[0,54],"author":[1],"gives":[2],"efficient":[3,61],"parallel":[4,62],"algorithms":[5],"for":[6,52,64],"recognizing":[7,45],"chordal":[8,21,29,43],"graphs,":[9,47],"finding":[10,23,31,65],"a":[11,15,20,28,32,37,42,66],"maximum":[12,16],"clique":[13],"and":[14,36,48],"independent":[17],"set":[18],"in":[19],"graph,":[22,30,44],"an":[24,60],"optimal":[25],"coloring":[26],"of":[27,41],"breadth-first":[33],"search":[34,39],"tree":[35,40],"depth-first":[38],"interval":[46,50],"testing":[49],"graphs":[51],"isomorphism.":[53],"key":[55],"to":[56],"the":[57],"results":[58],"is":[59],"algorithm":[63],"perfect":[67],"elimination":[68],"ordering.>":[69]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2124526408","counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
