14 citations · 19 across the 5 of their papers we have counts for
7 papers
Graph Profiling for Vertex Cover: Targeted Reductions in a Branch and Reduce Solver
Matthias F. Stallmann, Yang Ho, Timothy D. Goodrich
Akiba and Iwata [TCS, 2016] demonstrated that a branch and reduce (B&R) solver for the vertex cover problem can compete favorably with integer linear programming solvers (e.g., CPL…
Benchmarking treewidth as a practical component of tensor-network--based quantum simulation
Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich +3
Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computat…
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…
An Updated Experimental Evaluation of Graph Bipartization Methods
Timothy D. Goodrich, Eric Horton, Blair D. Sullivan
We experimentally evaluate the practical state-of-the-art in graph bipartization (Odd Cycle Transversal), motivated by recent advances in near-term quantum computing hardware and t…
Optimizing Adiabatic Quantum Program Compilation using a Graph-Theoretic Framework
Timothy D. Goodrich, Travis S. Humble, Blair D. Sullivan
Adiabatic quantum computing has evolved in recent years from a theoretical field into an immensely practical area, a change partially sparked by D-Wave System's quantum annealing h…
Asymptotic Analysis of Equivalences and Core-Structures in Kronecker-Style Graph Models
Alex J. Chin, Timothy D. Goodrich, Michael P. O'Brien +3
Growing interest in modeling large, complex networks has spurred significant research into generative graph models. Kronecker-style models (SKG and R-MAT) are often used due to the…
Hyperbolicity, degeneracy, and expansion of random intersection graphs
Matthew Farrell, Timothy Goodrich, Nathan Lemons +3
We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks wh…