Concepedia

Grant A. Cheston

GA

4

Publications

80

Citations

4

H-Index

1976

Active since

Affiliations

University of Saskatchewan(Current)

Wright State University

Grant A. Cheston is an author at University of Saskatchewan specializing in computational complexity, discrete mathematics, and graph theory.

Top concepts

Graph TheoryDiscrete MathematicsComputational ComplexityEducationEngineeringNetwork ScienceComputer ScienceGraph AlgorithmsNetwork AnalysisAlgorithm Design

Publications per year

1976–2006

4

Publications

4

On the computational complexity of upper fractional domination

Grant A. Cheston, Gerd H. Fricke, Stephen T. Hedetniemi et al. · Discrete Applied Mathematics · 1990 · 41 citations

Fractional-order System, Lower Bound, Computational Complexity +2

Incremental algorithms in graph theory.

Grant A. Cheston · 1976 · 17 citations

Engineering, Graph Algorithms, Graph Theory +6

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance

Grant A. Cheston, Gerd H. Fricke · Discrete Applied Mathematics · 1994 · 11 citations

Graph Minor, Network Science, Upper Domination +9

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

Grant A. Cheston, Tjoen Seng Jap · Journal of Graph Algorithms and Applications · 2006 · 11 citations · Full text

Algorithmic Properties, Engineering, Planar Graph +18

Rows per page

1–4 of 4