3 citations · 5 across the 9 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.CO2026
Greedy Coloring and Simple Exponential Strengthenings of Brooks-Type Theorems
Alex Crane, Carl Feghali, Felicia Lucke +2
Brooks' Theorem is a foundational result in graph coloring: if a graph is connected, not a clique, and has maximum degree , then it admits a proper -coloring. In this p…
cs.DS2026
An Evaluation of Vertex Elimination Strategies for Algorithmic Differentiation
Alex Crane, Pål Grønås Drange, Eli Friedman +6
The algorithmic differentiation (AD) of mathematical functions can be interpreted as a sequence of vertex eliminations in an underlying directed acyclic graph. The problem of deter…