# Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes

For a given graph G, a maximum internal spanning tree of G is a spanning tree of G with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem is to find a maximum internal spanning tree of the given graph. The MIST problem is a generalization of the Hamiltonian path problem. Since the Hamiltonian path problem is NP-hard, even for bipartite and chordal graphs, two important subclasses of graphs, the MIST problem also remains NP-hard for these graph classes. In this paper, we propose linear-time algorithms to compute a maximum internal spanning tree of cographs, block graphs, cactus graphs, chain graphs and bipartite permutation graphs. The optimal path cover problem, which asks to find a path cover of the given graph with maximum number of edges, is also a well studied problem. In this paper, we also study the relationship between the number of internal vertices in maximum internal spanning tree and number of edges in optimal path cover for the special graph classes mentioned above.

• 1 publication
• 8 publications
• 3 publications
research
12/26/2017

### Near-linear Time Algorithms for Approximate Minimum Degree Spanning Trees

Given a graph G = (V, E), n=|V|, m=|E|, we wish to compute a spanning tr...
research
11/21/2017

### On P_5-free Chordal bipartite graphs

A bipartite graph is chordal bipartite if every cycle of length at least...
research
06/07/2023

### Linear Time Algorithms for NP-hard Problems restricted to GaTEx Graphs

The class of Galled-Tree Explainable (GaTEx) graphs has just recently be...
research
07/15/2020

### Leafy Spanning Arborescences in DAGs

Broadcasting in a computer network is a method of transferring a message...
research
09/17/2019

### The Maximum Binary Tree Problem

We introduce and investigate the approximability of the maximum binary t...
research
10/30/2020

### Approximating the clustered selected-internal Steiner tree problem

Given a complete graph G=(V,E), with nonnegative edge costs, two subsets...
research
02/24/2022

### A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

The Steiner tree problem, which asks for a minimum weighted tree spannin...