Triangulating three-colored graphs

Authors:
Sampath K. Kannan;Tandy J. Warnow
Affiliations:
DIMACS Center, Rutgers University, Piscataway, NJ;Department of Mathematics, University of California, Berkeley
Venue:
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Year:
1991

Citing 2
Cited 2

Complexity of finding embeddings in a k-tree

SIAM Journal on Algebraic and Discrete Methods
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Triangulating vertex colored graphs

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Generalizing the four gamete condition and splits equivalence theorem: perfect phylogeny on three state characters

WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract