A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/wads/BaderMY01
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/wads/BaderMY01
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Bernard_M._E._Moret
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/David_A._Bader
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mi_Yan
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F3-540-44634-6%5F34
>
foaf:
homepage
<
https://doi.org/10.1007/3-540-44634-6_34
>
dc:
identifier
DBLP conf/wads/BaderMY01
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F3-540-44634-6%5F34
(xsd:string)
dcterms:
issued
2001
(xsd:gYear)
rdfs:
label
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Bernard_M._E._Moret
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/David_A._Bader
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mi_Yan
>
swrc:
pages
365-376
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/wads/2001
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/wads/BaderMY01/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/wads/BaderMY01
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/wads/wads2001.html#BaderMY01
>
rdfs:
seeAlso
<
https://doi.org/10.1007/3-540-44634-6_34
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/wads
>
dc:
title
A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document