乐胖代购免代理版

{"id":"https://openalex.org/W2084386716","doi":"https://doi.org/10.1137/s0097539797322334","title":"Weakly Triangulated Comparability Graphs","display_name":"Weakly Triangulated Comparability Graphs","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2084386716","doi":"https://doi.org/10.1137/s0097539797322334","mag":"2084386716"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797322334","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":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"journal-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/A5014607906","display_name":"Elaine M. Eschen","orcid":"https://orcid.org/0000-0002-1089-5245"},"institutions":[{"id":"https://openalex.org/I9254433","display_name":"Fisk University","ror":"https://ror.org/01bbs6821","country_code":"US","type":"education","lineage":["https://openalex.org/I9254433"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elaine Eschen","raw_affiliation_strings":["Fisk University"],"affiliations":[{"raw_affiliation_string":"Fisk University","institution_ids":["https://openalex.org/I9254433"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030119496","display_name":"Ryan Hayward","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ryan B. Hayward","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111822996","display_name":"Jeremy Spinrad","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeremy Spinrad","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013122355","display_name":"R. Sritharan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"R. Sritharan","raw_affiliation_strings":[],"affiliations":[]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":4,"citation_normalized_percentile":{"value":0.528294,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":70,"max":72},"biblio":{"volume":"29","issue":"2","first_page":"378","last_page":"386"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9999,"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.9999,"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.9998,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9945,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/comparability","display_name":"Comparability","score":0.8215059},{"id":"https://openalex.org/keywords/interval-graph","display_name":"Interval graph","score":0.7570349},{"id":"https://openalex.org/keywords/comparability-graph","display_name":"Comparability graph","score":0.64817214},{"id":"https://openalex.org/keywords/transitive-reduction","display_name":"Transitive reduction","score":0.5970645},{"id":"https://openalex.org/keywords/transitive-closure","display_name":"Transitive closure","score":0.5618697},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.50051},{"id":"https://openalex.org/keywords/indifference-graph","display_name":"Indifference graph","score":0.48880574},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.43618038}],"concepts":[{"id":"https://openalex.org/C197947376","wikidata":"https://www.wikidata.org/wiki/Q5155608","display_name":"Comparability","level":2,"score":0.8215059},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.8023253},{"id":"https://openalex.org/C67810366","wikidata":"https://www.wikidata.org/wiki/Q835942","display_name":"Interval graph","level":5,"score":0.7570349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7208469},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.70758},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.64817214},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.5970645},{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.5618697},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5316931},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.510863},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.50051},{"id":"https://openalex.org/C74133993","wikidata":"https://www.wikidata.org/wiki/Q3115472","display_name":"Indifference graph","level":3,"score":0.48880574},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.47642145},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.44585913},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.43618038},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4108131},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37156144},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19391796},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.18165079},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.07167333}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797322334","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":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41,"id":"https://metadata.un.org/sdg/10"}],"grants":[],"datasets":[],"versions":[],"referenced_works_count":33,"referenced_works":["https://openalex.org/W1517921658","https://openalex.org/W1541277988","https://openalex.org/W1964119857","https://openalex.org/W1968148694","https://openalex.org/W1972467602","https://openalex.org/W1972965975","https://openalex.org/W1979740015","https://openalex.org/W1994038277","https://openalex.org/W2000763343","https://openalex.org/W2008802973","https://openalex.org/W2021348471","https://openalex.org/W2024353971","https://openalex.org/W2024491681","https://openalex.org/W2055650273","https://openalex.org/W2060352617","https://openalex.org/W2063410295","https://openalex.org/W2063906290","https://openalex.org/W2065769612","https://openalex.org/W2068361557","https://openalex.org/W2070099460","https://openalex.org/W2075989463","https://openalex.org/W2082068582","https://openalex.org/W2086119402","https://openalex.org/W2088435189","https://openalex.org/W2110920860","https://openalex.org/W2143474538","https://openalex.org/W2152506638","https://openalex.org/W2159176836","https://openalex.org/W2545919726","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W4230526896","https://openalex.org/W4299866835"],"related_works":["https://openalex.org/W4297054060","https://openalex.org/W2963936427","https://openalex.org/W2764268078","https://openalex.org/W2171308818","https://openalex.org/W2084386716","https://openalex.org/W2060105798","https://openalex.org/W2028563407","https://openalex.org/W2021661549","https://openalex.org/W2009489912","https://openalex.org/W1565068544"],"abstract_inverted_index":{"The":[0],"class":[1],"of":[2,12,26,67,98],"weakly":[3,49,68,104],"triangulated":[4,50,69,105],"comparability":[5,17,51,70,106],"graphs":[6,14,27,52,71],"and":[7,15,45,63,86],"their":[8],"complements":[9],"are":[10],"generalizations":[11],"interval":[13],"chordal":[16,38],"graphs.":[18,40],"We":[19,41,78],"show":[20,42],"that":[21,43,64],"problems":[22,36],"on":[23,37,48],"these":[24],"classes":[25],"can":[28,53],"be":[29,54],"solved":[30,55],"efficiently":[31],"by":[32],"transforming":[33],"them":[34],"into":[35],"bipartite":[39],"recognition":[44],"independent":[46],"set":[47],"in":[56,60,89],"O(n2":[57,90],")":[58],"time":[59,92],"this":[61],"manner,":[62],"the":[65,94,99],"number":[66],"is":[72,102],"$2^{\\Theta":[73],"(":[74],"n":[75],"{{\\log}^2}":[76],"n)}$.\\":[77],"also":[79],"give":[80],"algorithms":[81],"to":[82],"compute":[83],"transitive":[84,87,100],"closure":[85,101],"reduction":[88],"loglogn)":[91],"if":[93],"underlying":[95],"undirected":[96],"graph":[97],"a":[103],"graph.":[107]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2084386716","counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-01-16T09:19:06.350865","created_date":"2016-06-24"}