25 citations · 49 across the 3 of their papers we have counts for
5 papers
The Densest k Subgraph Problem in b-Outerplanar Graphs
Sean Gonzales, Theresa Migler
We give an exact algorithm for finding the densest k subgraph in outerplanar graphs. We extend this to an exact algorithm for finding the densest k subgraph…
Density decompositions of networks
Glencora Borradaile, Theresa Migler, Gordon Wilfong
We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decompos…
Lower bounds for testing digraph connectivity with one-pass streaming algorithms
Glencora Borradaile, Claire Mathieu, Theresa Migler
In this note, we show that three graph properties - strong connectivity, acyclicity, and reachability from a vertex to all vertices - each require a working memory of o…
Egalitarian Graph Orientations
Glencora Borradaile, Jennifer Iglesias, Theresa Migler +3
Given an undirected graph, one can assign directions to each of the edges of the graph, thus orienting the graph. To be as egalitarian as possible, one may wish to find an orientat…
Weight and rank of matrices over finite fields
Theresa Migler, Kent E. Morrison, Mitchell Ogle
Define the weight of a matrix to be the number of non-zero entries. One would like to count by matrices over a finite field by their weight and rank. This is equivalent to…