Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
CPM
/
Paper
Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time.
Thu-Hien To
,
Michel Habib
Venue
B
CPM
Year
2009
Proceedings
CPM
DBLP record
conf/cpm/ToH09 ↗
Browse the full
CPM paper archive
.