{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:14:48Z","timestamp":1729628088881,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/rivf.2013.6719886","type":"proceedings-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T21:23:41Z","timestamp":1390598621000},"page":"157-162","source":"Crossref","is-referenced-by-count":0,"title":["An O(n(log n)<sup>3<\/sup>) algorithm for maximum matching in trapezoid graphs"],"prefix":"10.1109","author":[{"given":"sNgoc-Khang","family":"Le","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"sPhan-Thuan","family":"Do","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","author":"de berg","year":"2008","journal-title":"Computational Geometry Algorithms and Applications"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1137\/0117070"},{"key":"13","article-title":"Solutions to klee's rectangle problems","author":"bentley","year":"1977","journal-title":"Unpublished manuscript"},{"journal-title":"Decomposable searching problems \"","year":"1979","author":"bentley","key":"14"},{"key":"11","first-page":"13","article-title":"An algorithm to find a maximum matching of a trapezoid","volume":"9","author":"gosh","year":"2005","journal-title":"Journal of the Korean Society for Industrial and Applied Mathematics IT Series"},{"journal-title":"On vertex covers and matching number of trapezoid graphs","year":"2011","author":"ilic","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(96)00013-3"},{"key":"2","first-page":"267","article-title":"Extensions of permutation and interval graphs","volume":"58","author":"corneil","year":"1987","journal-title":"Congressus Numerantium"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90032-7"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178659"},{"key":"7","article-title":"A parallel algorithm for maximum matching on interval graphs","author":"moitra","year":"1989","journal-title":"1989 International Conference on Parallel Processing"},{"key":"6","first-page":"17","article-title":"An o (p v e) algoithm for finding maximum matching in general graphs","volume":"1980","author":"micali","year":"0","journal-title":"Foundations of Computer Science 1980 21st Annual Symposium on IEEE"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1975.5"},{"key":"4","volume":"57","author":"golumbic","year":"2004","journal-title":"Algorithmic Graph Theory and Perfect Graphs"},{"journal-title":"An improved maximum matching algorithm in a permutation graph","year":"1995","author":"bauernoppel","key":"9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288685"}],"event":{"name":"2013 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2013,11,10]]},"location":"Hanoi, Vietnam","end":{"date-parts":[[2013,11,13]]}},"container-title":["The 2013 RIVF International Conference on Computing & Communication Technologies - Research, Innovation, and Vision for Future (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6712195\/6719848\/06719886.pdf?arnumber=6719886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,14]],"date-time":"2020-08-14T16:35:46Z","timestamp":1597422946000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6719886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/rivf.2013.6719886","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}