{"id":"https://openalex.org/W2006955534","doi":"https://doi.org/10.1137/s0097539792224814","title":"Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs","display_name":"Fast and Simple Algorithms for Recognizing Chordal Comparability Graphs and Interval Graphs","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2006955534","doi":"https://doi.org/10.1137/s0097539792224814","mag":"2006955534"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792224814","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792224814","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/A5119558606","display_name":"Wen\u2212Lian Hsu","orcid":"https://orcid.org/0000-0001-7061-3513"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wen-Lian Hsu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019719000","display_name":"Tze-Heng Ma","orcid":"https://orcid.org/0009-0009-4451-7507"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tze-Heng Ma","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5119558606"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5256,"has_fulltext":false,"cited_by_count":57,"citation_normalized_percentile":{"value":0.81870378,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"28","issue":"3","first_page":"1004","last_page":"1020"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.9343579411506653},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.9337105751037598},{"id":"https://openalex.org/keywords/comparability","display_name":"Comparability","score":0.6173650622367859},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.6123214364051819},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.5616874694824219},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5445691347122192},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5321183800697327},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5060381293296814},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.478240430355072},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.46171140670776367},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44616618752479553},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.42136603593826294},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4173988103866577},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.413134902715683},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3793667256832123},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3169342875480652},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15074297785758972},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.12510088086128235}],"concepts":[{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.9343579411506653},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.9337105751037598},{"id":"https://openalex.org/C197947376","wikidata":"https://www.wikidata.org/wiki/Q5155608","display_name":"Comparability","level":2,"score":0.6173650622367859},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.6123214364051819},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.5616874694824219},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5445691347122192},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5321183800697327},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5060381293296814},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.478240430355072},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.46171140670776367},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44616618752479553},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.42136603593826294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4173988103866577},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.413134902715683},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3793667256832123},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3169342875480652},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15074297785758972},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.12510088086128235},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s0097539792224814","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792224814","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.104.4647","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.104.4647","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.iis.sinica.edu.tw/IASL/webpdf/paper-1999-Fast_and_simple_algorithms_for_recognizing_chordal_comparability_graphs_and_interval_graphs.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W172298603","https://openalex.org/W1517921658","https://openalex.org/W1964604240","https://openalex.org/W1965753814","https://openalex.org/W1978452004","https://openalex.org/W1979740015","https://openalex.org/W1987927249","https://openalex.org/W1994038277","https://openalex.org/W2008802973","https://openalex.org/W2024491681","https://openalex.org/W2045364385","https://openalex.org/W2046662728","https://openalex.org/W2056697294","https://openalex.org/W2057556050","https://openalex.org/W2063410295","https://openalex.org/W2086119402","https://openalex.org/W2089465933","https://openalex.org/W2094742636","https://openalex.org/W2097374444","https://openalex.org/W2143474538","https://openalex.org/W2320198223","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2963009577","https://openalex.org/W2903402681","https://openalex.org/W1946718366","https://openalex.org/W1681620790","https://openalex.org/W1987143101","https://openalex.org/W2157783000","https://openalex.org/W2084631735","https://openalex.org/W1787922240","https://openalex.org/W35535541"],"abstract_inverted_index":{"In":[0],"this":[1,16],"paper,":[2],"we":[3,18],"present":[4],"a":[5,20,46],"linear-time":[6,21,48],"algorithm":[7,22,49],"for":[8,23,50],"substitution":[9],"decomposition":[10],"on":[11,15,26],"chordal":[12,27,35],"graphs.":[13],"Based":[14],"result,":[17],"develop":[19],"transitive":[24],"orientation":[25],"comparability":[28,36],"graphs,":[29],"which":[30],"reduces":[31],"the":[32],"complexity":[33],"of":[34],"recognition":[37,53],"from":[38],"O(n2":[39],")":[40],"to":[41],"O(n+m).":[42],"We":[43],"also":[44],"devise":[45],"simple":[47],"interval":[51],"graph":[52],"where":[54],"no":[55],"complicated":[56],"data":[57],"structure":[58],"is":[59],"involved.":[60]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}