Logan A. Smith

Orcid: 0000-0002-6919-8217

According to our database1, Logan A. Smith authored at least 8 papers between 2019 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs.
Networks, 2022

New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts.
Networks, 2022

Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph.
INFORMS J. Comput., 2022

2020
An integer program for positive semidefinite zero forcing in graphs.
Networks, 2020

Optimal Sensor Placement in Power Grids: Power Domination, Set Covering, and the Neighborhoods of Zero Forcing Forts.
CoRR, 2020

2019
Power domination throttling.
Theor. Comput. Sci., 2019

Connected power domination in graphs.
J. Comb. Optim., 2019

A Polynomial Time Algorithm for Computing the Strong Rainbow Connection Numbers of Odd Cacti.
CoRR, 2019


  Loading...