The Maximum Binary Tree Problem.
Published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) • Aug 1, 2020
Authors:,,
Karthekeyan Chandrasekaran
Elena Grigorescu
Gabriel Istrate
Abstract
We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree in a given graph. MBT is a natural variant of the well-studied longest path problem, since both can be viewed as finding...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!