{"id":"https://openalex.org/W1972539462","doi":"https://doi.org/10.1109/rivf.2013.6719886","title":"An O(n(log n)3) algorithm for maximum matching in trapezoid graphs","display_name":"An O(n(log n)3) algorithm for maximum matching in trapezoid graphs","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W1972539462","doi":"https://doi.org/10.1109/rivf.2013.6719886","mag":"1972539462"},"language":"en","primary_location":{"id":"doi:10.1109/rivf.2013.6719886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100828999","display_name":"sNgoc-Khang Le","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"sNgoc-Khang Le","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","institution_ids":["https://openalex.org/I94518387"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102077925","display_name":"sPhan-Thuan Do","orcid":null},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"sPhan-Thuan Do","raw_affiliation_strings":["School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]},{"raw_affiliation_string":"[School of Information and Communication Technology, Hanoi University of Science and Technology, Hanoi, Vietnam]","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I94518387"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07783381,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"157","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9987999796867371,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9976999759674072,"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/combinatorics","display_name":"Combinatorics","score":0.747887909412384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6220760345458984},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5516713857650757},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.547200620174408},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4992971420288086},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4863436818122864},{"id":"https://openalex.org/keywords/hopcroft\u2013karp-algorithm","display_name":"Hopcroft\u2013Karp algorithm","score":0.4710884988307953},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4474145472049713},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.43519720435142517},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4300113022327423},{"id":"https://openalex.org/keywords/maximal-independent-set","display_name":"Maximal independent set","score":0.41426581144332886},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39751100540161133},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.34858623147010803},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24784499406814575},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.24311912059783936},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.15741565823554993}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.747887909412384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6220760345458984},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5516713857650757},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.547200620174408},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4992971420288086},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4863436818122864},{"id":"https://openalex.org/C100107663","wikidata":"https://www.wikidata.org/wiki/Q1516988","display_name":"Hopcroft\u2013Karp algorithm","level":5,"score":0.4710884988307953},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4474145472049713},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.43519720435142517},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4300113022327423},{"id":"https://openalex.org/C18359143","wikidata":"https://www.wikidata.org/wiki/Q7888149","display_name":"Maximal independent set","level":5,"score":0.41426581144332886},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39751100540161133},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.34858623147010803},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24784499406814575},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.24311912059783936},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.15741565823554993},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/rivf.2013.6719886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rivf.2013.6719886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W35758821","https://openalex.org/W1551053989","https://openalex.org/W1969693641","https://openalex.org/W1973538756","https://openalex.org/W2003813631","https://openalex.org/W2010733068","https://openalex.org/W2047570770","https://openalex.org/W2060978628","https://openalex.org/W2065295938","https://openalex.org/W2092333800","https://openalex.org/W2143474538","https://openalex.org/W2212241778","https://openalex.org/W4251391716","https://openalex.org/W4297789381","https://openalex.org/W6601411797"],"related_works":["https://openalex.org/W4283803822","https://openalex.org/W2029336174","https://openalex.org/W2963009577","https://openalex.org/W2063494850","https://openalex.org/W2788975631","https://openalex.org/W3199257895","https://openalex.org/W2903402681","https://openalex.org/W4225525972","https://openalex.org/W1994963913","https://openalex.org/W4387807253"],"abstract_inverted_index":{"Trapezoid":[0],"graphs":[1,4,103],"are":[2,15],"intersection":[3],"of":[5,35,71,81,130],"trapezoids":[6],"between":[7],"two":[8],"horizontal":[9],"lines.":[10],"Many":[11],"graph":[12,31,118,121],"problems":[13],"that":[14],"NP-hard":[16],"in":[17,29,73,101],"general":[18],"case":[19],"have":[20],"polynomial":[21],"time":[22],"algorithms":[23],"for":[24,96,115,141],"trapezoid":[25,102,142],"graphs.":[26,143],"A":[27],"matching":[28,42,45,100,139],"a":[30,33,40,44,55,74,82,98,116],"is":[32,43,48,134],"set":[34],"pairwise":[36],"non-adjacent":[37],"edges,":[38],"and":[39,77],"maximum":[41,69,99,138],"whose":[46],"cardinality":[47],"maximum.":[49],"In":[50,109],"this":[51,87,113,133],"paper,":[52],"we":[53,111],"define":[54],"modified":[56],"range":[57,125],"tree":[58],"data":[59,88],"structure,":[60],"called":[61],"S-Range":[62],"tree,":[63],"which":[64],"allows":[65],"to":[66,90],"report":[67],"the":[68,79,128,135],"label":[70,80],"points":[72],"rectangular":[75],"region":[76],"update":[78],"point":[83],"efficiently.":[84],"We":[85],"use":[86],"structure":[89],"construct":[91],"an":[92],"O(n(log":[93],"n)3)":[94],"algorithm":[95,114,140],"finding":[97],"based":[104],"on":[105],"their":[106],"box":[107],"representation.":[108],"addition,":[110],"generalize":[112],"larger":[117],"class,":[119],"k-trapezoid":[120],"by":[122],"using":[123],"multidimensional":[124],"tree.":[126],"To":[127],"best":[129],"our":[131],"knowledge,":[132],"first":[136],"efficient":[137]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}