{"id":"https://openalex.org/W2006001074","doi":"https://doi.org/10.1137/0405022","title":"An Optimal Algorithm for the Maximum Two-Chain Problem","display_name":"An Optimal Algorithm for the Maximum Two-Chain Problem","publication_year":1992,"publication_date":"1992-05-01","ids":{"openalex":"https://openalex.org/W2006001074","doi":"https://doi.org/10.1137/0405022","mag":"2006001074"},"language":"en","primary_location":{"id":"doi:10.1137/0405022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405022","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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/A5108572287","display_name":"R. D. Lou","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"R. D. Lou","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078132977","display_name":"Majid Sarrafzadeh","orcid":"https://orcid.org/0000-0001-8407-8689"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. Sarrafzadeh","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5044536955","display_name":"D. T. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108572287"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4107894,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.91310976,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"5","issue":"2","first_page":"285","last_page":"304"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12923","display_name":"Digital Image Processing Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/chain","display_name":"Chain (unit)","score":0.8242119550704956},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.7795675992965698},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7651168704032898},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7335550785064697},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4831082820892334},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.46862131357192993},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45439958572387695},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4496583640575409},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.42649421095848083},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.383344829082489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1259254813194275}],"concepts":[{"id":"https://openalex.org/C199185054","wikidata":"https://www.wikidata.org/wiki/Q552299","display_name":"Chain (unit)","level":2,"score":0.8242119550704956},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.7795675992965698},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7651168704032898},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7335550785064697},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4831082820892334},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.46862131357192993},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45439958572387695},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4496583640575409},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.42649421095848083},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.383344829082489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1259254813194275},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0405022","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0405022","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"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 Discrete Mathematics","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":6,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1966224002","https://openalex.org/W2024116303","https://openalex.org/W2111890199","https://openalex.org/W2170359320","https://openalex.org/W2911302472"],"related_works":["https://openalex.org/W2002177687","https://openalex.org/W2058438338","https://openalex.org/W2019471580","https://openalex.org/W2941284322","https://openalex.org/W4224920876","https://openalex.org/W2168299207","https://openalex.org/W2124475651","https://openalex.org/W2585354854","https://openalex.org/W2064478620","https://openalex.org/W4320830217"],"abstract_inverted_index":{"Given":[0],"a":[1,6,9,32,55,61,78,82],"point":[2,83],"set":[3,84],"$\\rho":[4,35,85],"$,":[5,86],"chain":[7],"is":[8,24,31,53],"subset":[10,33],"$\\mathcal{C}":[11],"\\subseteq":[12],"\\rho":[13,91],"$":[14,36],"of":[15,34],"points":[16],"in":[17,81],"which,":[18],"for":[19,76,98],"any":[20],"two":[21,42],"points,":[22],"one":[23],"dominated":[25],"by":[26],"the":[27],"other.":[28],"A":[29,44],"two-chain":[30,45,80,94],"that":[37],"can":[38],"be":[39],"partitioned":[40],"into":[41],"chains.":[43],"with":[46],"maximum":[47,56,79],"cardinality":[48],"among":[49],"all":[50],"possible":[51],"two-chains":[52],"called":[54],"two-chain.":[57],"This":[58],"paper":[59],"presents":[60],"$\\Theta":[62,70],"(":[63,71],"n":[64,66,72],"\\log":[65],")$":[67,73],"time":[68],"and":[69,104],"space":[74],"algorithm":[75],"finding":[77],"where":[87],"$n":[88],"=":[89],"|":[90],"|$.":[92],"Maximum":[93],"has":[95],"applications":[96],"in,":[97],"example,":[99],"graph-theoretic":[100],"problems,":[101],"VLSI":[102],"layout,":[103],"sequence":[105],"manipulation.":[106]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}