Structure and linear time recognition of 3-leaf powers

A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is the k-leaf root of G. This notion was introduced and studied by Nishimura, Ragde, and Thilikos motivated by the search for underlying phylogenetic trees. Their results imply a O(n3) time recognition algorithm for 3-leaf powers. Later, Dom, Guo, H

• Type: Journal
• Year: 2006
• Where: IPL
• Authors: Andreas Brandstädt, Van Bang Le
• Keywords: 3-leaf Power, IPL 2006, Time Recognition, Time Recognition Algorithm