An O(n(log n)3) algorithm for maximum matching in trapezoid graphs.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/rivf/LeD13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/rivf/LeD13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ngoc-Khang_Le
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Phan-Thuan_Do
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FRIVF.2013.6719886
>
foaf:
homepage
<
https://doi.org/10.1109/RIVF.2013.6719886
>
dc:
identifier
DBLP conf/rivf/LeD13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FRIVF.2013.6719886
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
rdfs:
label
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ngoc-Khang_Le
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Phan-Thuan_Do
>
swrc:
pages
157-162
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/rivf/2013
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/rivf/LeD13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/rivf/LeD13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/rivf/rivf2013.html#LeD13
>
rdfs:
seeAlso
<
https://doi.org/10.1109/RIVF.2013.6719886
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/rivf
>
dc:
title
An O(n(log n)3) algorithm for maximum matching in trapezoid graphs.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document