{"id":"https://openalex.org/W2153789027","doi":"https://doi.org/10.1137/s0097539789166880","title":"Efficient Parallel Algorithms for Chordal Graphs","display_name":"Efficient Parallel Algorithms for Chordal Graphs","publication_year":1996,"publication_date":"1996-08-01","ids":{"openalex":"https://openalex.org/W2153789027","doi":"https://doi.org/10.1137/s0097539789166880","mag":"2153789027"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539789166880","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539789166880","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5035567880","display_name":"Philip N. Klein","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Philip N. Klein","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5035567880"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5059,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.68375582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"25","issue":"4","first_page":"797","last_page":"827"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9973999857902527,"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.9966999888420105,"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.936654269695282},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.910025954246521},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6182482242584229},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.6076958775520325},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5856372117996216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5514984726905823},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5382162928581238},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5126885175704956},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5046929121017456},{"id":"https://openalex.org/keywords/block-graph","display_name":"Block graph","score":0.4805772304534912},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44589945673942566},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.4222526550292969},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41273102164268494},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40355950593948364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32742801308631897},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16408908367156982},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.14717718958854675}],"concepts":[{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.936654269695282},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.910025954246521},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6182482242584229},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.6076958775520325},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5856372117996216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5514984726905823},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5382162928581238},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5126885175704956},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5046929121017456},{"id":"https://openalex.org/C43413943","wikidata":"https://www.wikidata.org/wiki/Q4927193","display_name":"Block graph","level":5,"score":0.4805772304534912},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44589945673942566},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.4222526550292969},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41273102164268494},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40355950593948364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32742801308631897},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16408908367156982},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.14717718958854675}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539789166880","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539789166880","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1495059240","https://openalex.org/W1655990431","https://openalex.org/W1968285535","https://openalex.org/W1972332180","https://openalex.org/W1973310391","https://openalex.org/W1978583881","https://openalex.org/W1995040285","https://openalex.org/W2004350101","https://openalex.org/W2017223622","https://openalex.org/W2023154896","https://openalex.org/W2023518480","https://openalex.org/W2024491681","https://openalex.org/W2034924661","https://openalex.org/W2035331304","https://openalex.org/W2037106315","https://openalex.org/W2049327803","https://openalex.org/W2063410295","https://openalex.org/W2072122885","https://openalex.org/W2081385108","https://openalex.org/W2086119402","https://openalex.org/W2088570605","https://openalex.org/W2089081330","https://openalex.org/W2089465933","https://openalex.org/W2089898547","https://openalex.org/W2110140952","https://openalex.org/W2110287499","https://openalex.org/W2125182537","https://openalex.org/W2143462372","https://openalex.org/W2148417962","https://openalex.org/W2148686552","https://openalex.org/W2320198223","https://openalex.org/W2343730655","https://openalex.org/W2577446513"],"related_works":["https://openalex.org/W1964882757","https://openalex.org/W2117608641","https://openalex.org/W2024727135","https://openalex.org/W2153789027","https://openalex.org/W3162605084","https://openalex.org/W2004663694","https://openalex.org/W2143328773","https://openalex.org/W2084631735","https://openalex.org/W2484485474","https://openalex.org/W2966902162"],"abstract_inverted_index":{"We":[0],"give":[1],"the":[2],"first":[3],"efficient":[4,62],"parallel":[5,63],"algorithms":[6],"for":[7,53,65],"recognizing":[8,46],"chordal":[9,22,30,44],"graphs,":[10,48],"finding":[11,24,32,66],"a":[12,16,21,29,33,38,43,67],"maximum":[13,17],"clique":[14],"and":[15,37,49],"independent":[18],"set":[19],"in":[20],"graph,":[23,31,45],"an":[25,61],"optimal":[26],"coloring":[27],"of":[28,42],"breadth-first":[34],"search":[35,40],"tree":[36,41],"depth-first":[39],"interval":[47,51],"testing":[50],"graphs":[52],"isomorphism.":[54],"The":[55],"key":[56],"to":[57],"our":[58],"results":[59],"is":[60],"algorithm":[64],"perfect":[68],"elimination":[69],"ordering.":[70]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}