1 citations · 1 across the 2 of their papers we have counts for
5 papers
An Extremal Problem on Rainbow Spanning Trees in Graphs
Matthew DeVilbiss, Bradley Fain, Amber Holmes +3
A spanning tree of an edge-colored graph is rainbow provided that each of its edges receives a distinct color. In this paper we consider the natural extremal problem of maximizing…
Random Walks on Simplicial Complexes and the normalized Hodge 1-Laplacian
Michael T. Schaub, Austin R. Benson, Paul Horn +2
Focusing on coupling between edges, we generalize the relationship between the normalized graph Laplacian and random walks on graphs by devising an appropriate normalization for th…
An -Approximation Algorithm for Dynamic Weighted Vertex Cover with Soft Capacity
Hao-Ting Wei, Wing-Kai Hon, Paul Horn +2
This study considers the (soft) capacitated vertex cover problem in a dynamic setting. This problem generalizes the dynamic model of the vertex cover problem, which has been intens…
Two Layer 3D Floor Planning
Paul Horn, Gabor Lippner
A 3D floor plan is a non-overlapping arrangement of blocks within a large box. Floor planning is a central notion in chip-design, and with recent advances in 3D integrated circuits…
Spreading Processes and Large Components in Ordered, Directed Random Graphs
Paul Horn, Malik Magdon-Ismail
Order the vertices of a directed random graph \math{v_1,...,v_n}; edge \math{(v_i,v_j)} for \math{i<j} exists independently with probability \math{p}. This random graph model is re…