[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/isaac/Monnot05>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%C2%A9r%E2%88%9A%C4%ABme_Monnot>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F11602613%5F93>
foaf:homepage <https://doi.org/10.1007/11602613_93>
dc:identifier DBLP conf/isaac/Monnot05 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F11602613%5F93 (xsd:string)
dcterms:issued 2005 (xsd:gYear)
rdfs:label On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/J%E2%88%9A%C2%A9r%E2%88%9A%C4%ABme_Monnot>
swrc:pages 934-943 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/isaac/2005>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/isaac/Monnot05/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/isaac/Monnot05>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/isaac/isaac2005.html#Monnot05>
rdfs:seeAlso <https://doi.org/10.1007/11602613_93>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/isaac>
dc:subject labeled matching; colored matching; bipartite graphs; NP-complete; approximate algorithms. (xsd:string)
dc:title On Complexity and Approximability of the Labeled Maximum/Perfect Matching Problems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document