Triangulating three-colored graphs

Sampath K. Kannan, Tandy J. Warnow

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We are interested here in the problem of determining whether we can triangulate a vertex-colored graph without introducing edges between vertices of the same color. This problem is motivated by a longstanding and fundamental problem in numerical taxonomy called the Perfect Phylogeny Problem, which is concerned with the inference of evolutionary history. This problem is also related to the problem of recognizing partial k-trees, a class of graphs that has received a lot of attention recently. In this paper we present an almost linear time algorithm for this problem in the case that the graph is three colored.

Original languageEnglish (US)
Title of host publicationProceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
PublisherAssociation for Computing Machinery
Pages337-343
Number of pages7
ISBN (Print)0897913760
StatePublished - Mar 1 1991
Externally publishedYes
Event2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 - San Francisco, United States
Duration: Jan 28 1991Jan 30 1991

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Other

Other2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991
CountryUnited States
CitySan Francisco
Period1/28/911/30/91

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'Triangulating three-colored graphs'. Together they form a unique fingerprint.

  • Cite this

    Kannan, S. K., & Warnow, T. J. (1991). Triangulating three-colored graphs. In Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1991 (pp. 337-343). (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms). Association for Computing Machinery.