Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Goodrich, Timothy D."'
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., CPLEX). Our research question is are there graph characteristics that det
Externí odkaz:
http://arxiv.org/abs/2003.06639
Autor:
Dumitrescu, Eugene F., Fisher, Allison L., Goodrich, Timothy D., Humble, Travis S., Sullivan, Blair D., Wright, Andrew L.
Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computational complexity of a tensor network simulation depends on the tensor
Externí odkaz:
http://arxiv.org/abs/1807.04599
Autor:
Demaine, Erik D., Goodrich, Timothy D., Kloster, Kyle, Lavallee, Brian, Liu, Quanquan C., Sullivan, Blair D., Vakilian, Ali, van der Poel, Andrew
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 scenario we expect is common when working with real-world networks) while
Externí odkaz:
http://arxiv.org/abs/1806.02771
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 the related embedding problems. We assemble a preprocessing suite of fa
Externí odkaz:
http://arxiv.org/abs/1805.01041
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 hardware. These multimillion-dollar quantum annealers offer the potenti
Externí odkaz:
http://arxiv.org/abs/1704.01996
Autor:
Chin, Alex J., Goodrich, Timothy D., O'Brien, Michael P., Reidl, Felix, Sullivan, Blair D., van der Poel, Andrew
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 their scalability and ability to mimic key properties of real-world netwo
Externí odkaz:
http://arxiv.org/abs/1609.05081
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dumitrescu, Eugene F., Fisher, Allison L., Goodrich, Timothy D., Humble, Travis S., Sullivan, Blair D., Wright, Andrew L.
Publikováno v:
PLoS ONE; 12/18/2018, Vol. 13 Issue 12, p1-19, 19p
Autor:
Farrell, Matthew, Goodrich, Timothy D., Lemons, Nathan, Reidl, Felix, Sánchez Villaamil, Fernando, Sullivan, Blair D.
Publikováno v:
Algorithms & Models for the Web Graph: 12th International Workshop, WAW 2015, Eindhoven, The Netherlands, December 10-11, 2015, Proceedings; 2015, p29-41, 13p