Grant A. Cheston

According to our database, Grant A. Cheston authored at least 10 papers between 1974 and 2006.

Collaborative distances:

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

2006

A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs.

Grant A. Cheston, Tjoen Seng Jap

J. Graph Algorithms Appl., 2006

2002

Integrating Software Engineering in Introductory Computing Courses.

Grant A. Cheston, J. Paul Tremblay

IEEE Softw., 2002

2000

The even adjacency split problem for graphs.

Grant A. Cheston, Stephen T. Hedetniemi, Arthur L. Liestman, J. B. Stehman

Discret. Appl. Math., 2000

1994

A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.

K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston

Inf. Process. Lett., 1994

Classes of Graphs for Which Upper Fractional Domination Equals Independence, Upper Domination, and upper Irredundance.

Grant A. Cheston, Gerd Fricke

Discret. Appl. Math., 1994

1990

On the computational complexity of upper fractional domination.

Grant A. Cheston, Gerd Fricke, Stephen T. Hedetniemi, David Pokrass Jacobs

Discret. Appl. Math., 1990

1989

Centering a Spanning Tree of a Biconnected Graph.

Grant A. Cheston, Arthur M. Farley, Stephen T. Hedetniemi, Andrzej Proskurowski

Inf. Process. Lett., 1989

1984

On-line connectivity algorithms.

Grant A. Cheston

Networks, 1984

1978

A Correction to a Unilaterally Connected Components Algorithm.

Grant A. Cheston

Inf. Process. Lett., 1978

1974

Restarts and Rotations of Quasi-Newton Methods.

David F. Shanno, Allen Berg, Grant A. Cheston

Proceedings of the Information Processing, 1974