A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad...
For a graph G, let fij be the number of spanning rooted forests in which vertex j belongs to a tree rooted at i. In this paper, we show that for a path, the fij's can be expr...
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
Anupam Gupta, John D. Lafferty, Han Liu, Larry A. ...
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...