3 citations · 3 across the 1 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2015
Canonizing Graphs of Bounded Tree Width in Logspace
Michael Elberfeld, Pascal Schweitzer
Graph canonization is the problem of computing a unique representative, a canon, from the isomorphism class of a given graph. This implies that two graphs are isomorphic exactly if…
cs.CC2009★ 3 cited
Perfect Phylogeny Haplotyping is Complete for Logspace
Michael Elberfeld
Haplotyping is the bioinformatics problem of predicting likely haplotypes based on given genotypes. It can be approached using Gusfield's perfect phylogeny haplotyping (PPH) method…