3 papers
math.SP2019
Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Mohammad Adm, Shaun Fallat, Karen Meagher +3
Associated to a graph is a set of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the gr…
math.CO2018
Properties of a -analogue of zero forcing
Steve Butler, Craig Erickson, Shaun Fallat +6
Zero forcing is a combinatorial game played on a graph where the goal is to start with all vertices unfilled and to change them to filled at minimal cost. In the original variation…
cs.DS2013
Algorithms for Cut Problems on Trees
Iyad Kanj, Guohui Lin, Tian Liu +7
We study the {\sc multicut on trees} and the {\sc generalized multiway Cut on trees} problems. For the {\sc multicut on trees} problem, we present a parameterized algorithm that ru…