[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/ipps/AndrewsACL95>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/D._T._Lee>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Danny_Z._Chen>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Marilyn_G._Andrews>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Mikhail_J._Atallah>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FIPPS.1995.395918>
foaf:homepage <https://doi.org/10.1109/IPPS.1995.395918>
dc:identifier DBLP conf/ipps/AndrewsACL95 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FIPPS.1995.395918 (xsd:string)
dcterms:issued 1995 (xsd:gYear)
rdfs:label Parallel algorithms for maximum matching in interval graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/D._T._Lee>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Danny_Z._Chen>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Marilyn_G._Andrews>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Mikhail_J._Atallah>
swrc:pages 84-92 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/ipps/1995>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/ipps/AndrewsACL95/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/ipps/AndrewsACL95>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/ipps/ipps1995.html#AndrewsACL95>
rdfs:seeAlso <https://doi.org/10.1109/IPPS.1995.395918>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/ipps>
dc:subject parallel algorithms; graph theory; hypercube networks; computational complexity; interval graphs; maximum matching; parallel algorithms; disjoint intervals; maximum cardinality matchings; EREW PRAM; hypercube model; EREW PRAM model; processors; computation time; unsorted input; sorted input; optimal sequential algorithms (xsd:string)
dc:title Parallel algorithms for maximum matching in interval graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document