[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/isaac/PengT04>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Hing-Fung_Ting>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Zeshan_Peng>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-30551-4%5F65>
foaf:homepage <https://doi.org/10.1007/978-3-540-30551-4_65>
dc:identifier DBLP conf/isaac/PengT04 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-30551-4%5F65 (xsd:string)
dcterms:issued 2004 (xsd:gYear)
rdfs:label An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Hing-Fung_Ting>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Zeshan_Peng>
swrc:pages 754-765 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/isaac/2004>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/isaac/PengT04/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/isaac/PengT04>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/isaac/isaac2004.html#PengT04>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-30551-4_65>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/isaac>
dc:title An O(n log n)-Time Algorithm for the Maximum Constrained Agreement Subtree Problem for Binary Trees. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document