Caleb C. Fast

According to our database, Caleb C. Fast authored at least 4 papers between 2017 and 2019.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2019

Computational approaches for zero forcing and related problems.

Boris Brimkov, Caleb C. Fast, Illya V. Hicks

Eur. J. Oper. Res., 2019

2018

Effects of vertex degrees on the zero-forcing number and propagation time of a graph.

Caleb C. Fast, Illya V. Hicks

Discret. Appl. Math., 2018

2017

A Branch Decomposition Algorithm for the <i>p</i>-Median Problem.

Caleb C. Fast, Illya V. Hicks

INFORMS J. Comput., 2017

Graphs with Extremal Connected Forcing Numbers.

Boris Brimkov, Caleb C. Fast, Illya V. Hicks

CoRR, 2017