Back to Results
First PageMeta Content
Computational complexity theory / Abstract algebra / Permutation / Best / worst and average case / Sorting / Sorting algorithms / Mathematics / Combinatorics


Average-case complexity analysis of perfect sorting by reversals Mathilde Bouvel1 Cedric Chauve2 Dominique Rossin1
Add to Reading List

Document Date: 2009-06-24 09:20:20

Open Document

File Size: 371,89 KB

Share Result on Facebook

City

Burnaby / Paris / /

Country

France / Canada / /

Facility

Simon Fraser University / /

Organization

LIAFA / Department of Mathematics / CNRS / Universite´ Paris Diderot / Simon Fraser University / /

Person

Mathilde Bouvel / /

Technology

FPT algorithm / Polynomial algorithms / reversals Algorithm / /

SocialTag