1 citations · 1 across the 15 of their papers we have counts for
4 papers · 1 filter
Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes
Gopika Sharma, Arti Pandey, Michael C. Wigal
For a given graph , a maximum internal spanning tree of is a spanning tree of with maximum number of internal vertices. The Maximum Internal Spanning Tree (MIST) problem…
Approximating TSP walks in subcubic graphs
Michael C. Wigal, Youngho Yoo, Xingxing Yu
We prove that every simple 2-connected subcubic graph on vertices with vertices of degree 2 has a TSP walk of length at most , confirming a conjecture…
Hardness and Approximation of Submodular Minimum Linear Ordering Problems
Majid Farhadi, Swati Gupta, Shengding Sun +2
The minimum linear ordering problem (MLOP) generalizes well-known combinatorial optimization problems such as minimum linear arrangement and minimum sum set cover. MLOP seeks to mi…
On Tutte cycles containing three prescribed edges
Michael C. Wigal, Xingxing Yu
A cycle in a graph is called a Tutte cycle if, after deleting from , each component has at most three neighbors on . Tutte cycles play an important role in the st…