19 citations · 24 across the 4 of their papers we have counts for
4 papers
Two Proofs of the Hamiltonian Cycle Identity
Hamilton Sawczuk, Edinah Gnang
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length . We ado…
Symbolic Listings as Computation
Hamilton Sawczuk, Edinah Gnang
We propose an algebraic model of computation which formally relates symbolic listings, complexity of Boolean functions, and low depth arithmetic circuit complexity. In this model a…
The Phantom Alignment Strength Conjecture: Practical use of graph matching alignment strength to indicate a meaningful graph match
Donniell E. Fishkind, Felix Parker, Hamilton Sawczuk +5
The alignment strength of a graph matching is a quantity that gives the practitioner a measure of the correlation of the two graphs, and it can also give the practitioner a sense f…
Optimal Resource and Demand Redistribution for Healthcare Systems Under Stress from COVID-19
Felix Parker, Hamilton Sawczuk, Fardin Ganjkhanloo +2
When facing an extreme stressor, such as the COVID-19 pandemic, healthcare systems typically respond reactively by creating surge capacity at facilities that are at or approaching…