{"id":"https://openalex.org/W1969279846","doi":"https://doi.org/10.1137/s0097539792269095","title":"Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs","display_name":"Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs","publication_year":1996,"publication_date":"1996-04-01","ids":{"openalex":"https://openalex.org/W1969279846","doi":"https://doi.org/10.1137/s0097539792269095","mag":"1969279846"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792269095","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792269095","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/A5100638710","display_name":"Xiaotie Deng","orcid":"https://orcid.org/0000-0002-5282-6467"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiaotie Deng","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075416144","display_name":"Pavol Hell","orcid":"https://orcid.org/0000-0001-7609-9746"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pavol Hell","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033343038","display_name":"Jing Huang","orcid":"https://orcid.org/0000-0003-0786-2271"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jing Huang","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100638710"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.6388,"has_fulltext":false,"cited_by_count":186,"citation_normalized_percentile":{"value":0.9465539,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":100},"biblio":{"volume":"25","issue":"2","first_page":"390","last_page":"403"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9976000189781189,"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.9973000288009644,"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/indifference-graph","display_name":"Indifference graph","score":0.726283848285675},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7162219285964966},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.7039081454277039},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.6748840808868408},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6130478978157043},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5613843202590942},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5532361268997192},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5514326691627502},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.5187649726867676},{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.5047518014907837},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.4824129343032837},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.46704620122909546},{"id":"https://openalex.org/keywords/characterization","display_name":"Characterization (materials science)","score":0.46078431606292725},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.45627254247665405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4557506740093231},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.43808525800704956},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42763012647628784},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35065174102783203},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.345022976398468},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.16045066714286804}],"concepts":[{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.726283848285675},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7162219285964966},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.7039081454277039},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.6748840808868408},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6130478978157043},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5613843202590942},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5532361268997192},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5514326691627502},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.5187649726867676},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.5047518014907837},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.4824129343032837},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.46704620122909546},{"id":"https://openalex.org/C2780841128","wikidata":"https://www.wikidata.org/wiki/Q5073781","display_name":"Characterization (materials science)","level":2,"score":0.46078431606292725},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.45627254247665405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4557506740093231},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.43808525800704956},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42763012647628784},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35065174102783203},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.345022976398468},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.16045066714286804},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C171250308","wikidata":"https://www.wikidata.org/wiki/Q11468","display_name":"Nanotechnology","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539792269095","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792269095","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":14,"referenced_works":["https://openalex.org/W1603708242","https://openalex.org/W1985464850","https://openalex.org/W1988677472","https://openalex.org/W2006048213","https://openalex.org/W2006507202","https://openalex.org/W2024491681","https://openalex.org/W2037424045","https://openalex.org/W2057221145","https://openalex.org/W2057556050","https://openalex.org/W2066204507","https://openalex.org/W2074047667","https://openalex.org/W2084631735","https://openalex.org/W2155577291","https://openalex.org/W2320198223"],"related_works":["https://openalex.org/W2788975631","https://openalex.org/W2903402681","https://openalex.org/W1681620790","https://openalex.org/W2952658105","https://openalex.org/W4298846841","https://openalex.org/W1977862280","https://openalex.org/W2950872944","https://openalex.org/W645031676","https://openalex.org/W2031276298","https://openalex.org/W2530575142"],"abstract_inverted_index":{"Our":[0],"main":[1],"result":[2],"is":[3,110],"a":[4,57,87,121,133,137],"linear-time":[5,89],"(that":[6],"is,":[7],"time":[8,29],"$O(m":[9],"+":[10],"n)$)":[11],"algorithm":[12,64,90,98],"to":[13,25,85,91],"recognize":[14],"and":[15,54,113],"represent":[16,92],"proper":[17,43,76,93,106,140],"circular-arc":[18,44],"graphs.":[19,78,95,108],"The":[20,63],"best":[21],"previous":[22],"algorithm,":[23,129],"due":[24],"A.":[26],"Tucker,":[27],"has":[28],"complexity":[30],"$O(n^2":[31],")$.":[32],"We":[33],"take":[34],"advantage":[35],"of":[36,60,69,71,105,123,127,136,139],"the":[37,48,72,124,128],"fact":[38],"that":[39],"(among":[40],"connected":[41],"graphs)":[42],"graphs":[45,49,142],"are":[46],"precisely":[47],"orientable":[50],"as":[51,75],"local":[52,61],"tournaments,":[53],"we":[55,80,130],"use":[56,116],"new":[58,88,134],"characterization":[59,104,138],"tournaments.":[62],"depends":[65,100],"on":[66,101],"repeated":[67],"representation":[68],"portions":[70],"input":[73],"graph":[74],"interval":[77,94,107,141],"Thus":[79],"also":[81,99,131],"find":[82],"it":[83],"useful":[84],"give":[86],"This":[96],"latter":[97],"an":[102],"orientation":[103],"It":[109],"conceptually":[111],"simple":[112],"does":[114],"not":[115],"complex":[117],"data":[118],"structures.":[119],"As":[120],"byproduct":[122],"correctness":[125],"proof":[126,135],"obtain":[132],"by":[143],"forbidden":[144],"subgraphs.":[145]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":11},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":16}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}