Mélodie Lapointe

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
Let G be a simple graph of n vertices. We consider the problem IS` of deciding whether there exists an induced subtree with exactly i ≤ n vertices and ` leaves inG. We also study the associated optimization problem, that consists in computing the maximal number of leaves, denoted by LG(i), realized by an induced subtree with i vertices, for 2 ≤ i ≤ n. We(More)
  • 1