{"id":"https://openalex.org/W2057556050","doi":"https://doi.org/10.1137/0218005","title":"An Incremental Linear-Time Algorithm for Recognizing Interval Graphs","display_name":"An Incremental Linear-Time Algorithm for Recognizing Interval Graphs","publication_year":1989,"publication_date":"1989-02-01","ids":{"openalex":"https://openalex.org/W2057556050","doi":"https://doi.org/10.1137/0218005","mag":"2057556050"},"language":"en","primary_location":{"id":"doi:10.1137/0218005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218005","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/A5022510078","display_name":"Norbert Korte","orcid":null},"institutions":[{"id":"https://openalex.org/I4210162505","display_name":"Philips (Germany)","ror":"https://ror.org/05san5604","country_code":"DE","type":"company","lineage":["https://openalex.org/I4210122849","https://openalex.org/I4210162505"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Norbert Korte","raw_affiliation_strings":["Philips Design Zentrum, W. Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Philips Design Zentrum, W. Germany#TAB#","institution_ids":["https://openalex.org/I4210162505"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001357515","display_name":"Rolf H. M\u00f6hring","orcid":"https://orcid.org/0000-0003-3766-8728"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rolf H. M\u00f6hring","raw_affiliation_strings":["Technische Univ. Berlin, Berlin, W. Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Technische Univ. Berlin, Berlin, W. Germany#TAB#","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022510078"],"corresponding_institution_ids":["https://openalex.org/I4210162505"],"apc_list":null,"apc_paid":null,"fwci":2.8082,"has_fulltext":false,"cited_by_count":177,"citation_normalized_percentile":{"value":0.91197971,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"1","first_page":"68","last_page":"81"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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.9997000098228455,"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.9980000257492065,"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.9972000122070312,"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.6691224575042725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6461813449859619},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5955387353897095},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5771104097366333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5298423767089844},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5036939978599548},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49768689274787903},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48158812522888184},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46112436056137085},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.45241236686706543},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"Graph algorithms","score":0.44134756922721863},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.414916455745697},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.410763680934906},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3286780118942261},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.1602174937725067},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15241914987564087}],"concepts":[{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6691224575042725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6461813449859619},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5955387353897095},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5771104097366333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5298423767089844},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5036939978599548},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49768689274787903},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48158812522888184},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46112436056137085},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.45241236686706543},{"id":"https://openalex.org/C2986651925","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Graph algorithms","level":3,"score":0.44134756922721863},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.414916455745697},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.410763680934906},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3286780118942261},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.1602174937725067},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15241914987564087}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218005","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218005","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1971937941","https://openalex.org/W1987927249","https://openalex.org/W1991477862","https://openalex.org/W2024491681","https://openalex.org/W2086119402","https://openalex.org/W2089465933","https://openalex.org/W2162494152","https://openalex.org/W2169586176","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W1987143101","https://openalex.org/W2963009577","https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W2251679127","https://openalex.org/W2407722793","https://openalex.org/W2157783000","https://openalex.org/W2077583413","https://openalex.org/W2028363955","https://openalex.org/W2584187496"],"abstract_inverted_index":{"The":[0],"fastest-known":[1],"algorithm":[2,60],"for":[3],"recognizing":[4],"interval":[5,71],"graphs":[6],"[S.":[7],"Booth":[8],"and":[9],"S.":[10],"Lucker,":[11],"J.":[12],"Comput.":[13],"System":[14],"Sci.,":[15],"13":[16],"(1976),":[17],"pp.":[18],"335\u2013379]":[19],"iteratively":[20],"manipulates":[21],"the":[22,29,85],"system":[23],"of":[24,28,49,70],"all":[25,50],"maximal":[26],"cliques":[27],"given":[30],"graph":[31,86],"in":[32,37,77,87],"a":[33,41,46,57,62,88,94],"rather":[34],"complicated":[35],"way":[36],"order":[38,90],"to":[39,84],"construct":[40],"consecutive":[42,52],"arrangement":[43],"(more":[44],"precisely,":[45],"tree":[47,68,74],"representation":[48,69],"possible":[51],"arrangements).":[53],"This":[54,73],"paper":[55],"presents":[56],"much":[58,65],"simpler":[59],"using":[61],"related,":[63],"but":[64],"more":[66],"informative":[67],"graphs.":[72],"is":[75],"constructed":[76],"an":[78],"incremental":[79],"fashion":[80],"by":[81],"adding":[82,93],"vertices":[83],"predefined":[89],"such":[91],"that":[92],"vertex":[95],"u":[96],"takes":[97],"$O(|{\\operatorname{Adj}}(u)|":[98],"+":[99],"1)$":[100],"amortized":[101],"time.":[102]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":9}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}