[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/acm/LiangM93>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Glenn_K._Manacher>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Y._Daniel_Liang>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1145%2F170791.170879>
foaf:homepage <https://doi.org/10.1145/170791.170879>
dc:identifier DBLP conf/acm/LiangM93 (xsd:string)
dc:identifier DOI doi.org%2F10.1145%2F170791.170879 (xsd:string)
dcterms:issued 1993 (xsd:gYear)
rdfs:label An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Glenn_K._Manacher>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Y._Daniel_Liang>
swrc:pages 390-397 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/acm/1993>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/acm/LiangM93/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/acm/LiangM93>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/acm/csc93.html#LiangM93>
rdfs:seeAlso <https://doi.org/10.1145/170791.170879>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/acm>
dc:title An O(nlogn) Algorithm for Finding Minimal Path Cover in Circular-Arc Graphs. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document