{"id":"https://openalex.org/W1994038277","doi":"https://doi.org/10.1137/0214048","title":"On Comparability and Permutation Graphs","display_name":"On Comparability and Permutation Graphs","publication_year":1985,"publication_date":"1985-08-01","ids":{"openalex":"https://openalex.org/W1994038277","doi":"https://doi.org/10.1137/0214048","mag":"1994038277"},"language":"en","primary_location":{"id":"doi:10.1137/0214048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214048","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/A5111822996","display_name":"Jeremy Spinrad","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jeremy Spinrad","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111822996"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.1999,"has_fulltext":false,"cited_by_count":158,"citation_normalized_percentile":{"value":0.94147458,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"14","issue":"3","first_page":"658","last_page":"670"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9987999796867371,"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/comparability","display_name":"Comparability","score":0.7769663333892822},{"id":"https://openalex.org/keywords/permutation-graph","display_name":"Permutation graph","score":0.7592731714248657},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7225098013877869},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.5962207913398743},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.5943873524665833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5414687395095825},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.5279751420021057},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49998927116394043},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.47673070430755615},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.45873725414276123},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.4264620244503021},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41594985127449036},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41390717029571533},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36396318674087524},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3413050174713135},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.21903163194656372},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.06270074844360352}],"concepts":[{"id":"https://openalex.org/C197947376","wikidata":"https://www.wikidata.org/wiki/Q5155608","display_name":"Comparability","level":2,"score":0.7769663333892822},{"id":"https://openalex.org/C68965932","wikidata":"https://www.wikidata.org/wiki/Q7169369","display_name":"Permutation graph","level":3,"score":0.7592731714248657},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7225098013877869},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.5962207913398743},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.5943873524665833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5414687395095825},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5279751420021057},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49998927116394043},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.47673070430755615},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.45873725414276123},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.4264620244503021},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41594985127449036},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41390717029571533},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36396318674087524},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3413050174713135},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.21903163194656372},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.06270074844360352},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0214048","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0214048","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":12,"referenced_works":["https://openalex.org/W20372564","https://openalex.org/W99338136","https://openalex.org/W1655990431","https://openalex.org/W1971322036","https://openalex.org/W1972332180","https://openalex.org/W1985495277","https://openalex.org/W2033520777","https://openalex.org/W2063410295","https://openalex.org/W2111070448","https://openalex.org/W2166555321","https://openalex.org/W2320198223","https://openalex.org/W2325654786"],"related_works":["https://openalex.org/W1964328451","https://openalex.org/W1787922240","https://openalex.org/W2088435189","https://openalex.org/W4241518368","https://openalex.org/W1980856085","https://openalex.org/W1817108978","https://openalex.org/W2084386716","https://openalex.org/W4297053116","https://openalex.org/W2949641092","https://openalex.org/W1994038277"],"abstract_inverted_index":{"This":[0,77],"paper":[1],"presents":[2],"a":[3,7,30],"technique":[4],"for":[5,19,87],"orienting":[6],"comparability":[8,69,88],"graph":[9,89],"transitively":[10],"in":[11,32,39,45],"$O(n^2":[12,40],")$":[13,25,41,86,99],"time.":[14,26,100],"The":[15,56],"best":[16],"previous":[17,94],"algorithm":[18,58],"this":[20],"problem":[21,66],"required":[22,96],"$\\Omega":[23,97],"(n^3":[24,98],"When":[27],"combined":[28],"with":[29],"result":[31],"[SP],":[33],"we":[34],"can":[35,59],"recognize":[36],"permutation":[37,52],"graphs":[38,53,70],"time,":[42],"and":[43],"determine":[44],"the":[46,65,92],"same":[47],"time":[48],"complexity":[49],"whether":[50],"two":[51],"are":[54],"isomorphic.":[55],"orientation":[57],"also":[60],"be":[61],"used":[62],"to":[63,71],"reduce":[64],"of":[67,73,82],"recognizing":[68,74],"that":[72],"transitive":[75],"graphs.":[76],"gives":[78],"an":[79],"upper":[80],"bound":[81],"$O(n^{2.49":[83],"+":[84],"}":[85],"recognition,":[90],"while":[91],"fastest":[93],"algorithms":[95]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}