The following pages link to Grant A. Cheston (Q753844):
Displaying 13 items.
- On the computational complexity of upper fractional domination (Q753848) (← links)
- Centering a spanning tree of a biconnected graph (Q1123632) (← links)
- (Q1332758) (redirect page) (← links)
- A linear algorithm for centering a spanning tree of a biconnected graph (Q1332759) (← links)
- Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance (Q1343143) (← links)
- The even adjacency split problem for graphs (Q1566571) (← links)
- (Q3337487) (← links)
- (Q3676066) (← links)
- (Q3820628) (← links)
- (Q3934442) (← links)
- Graph Property Update Algorithms and Their Appligation to Distance Matrices (Q3967059) (← links)
- (Q4048496) (← links)
- A Survey of the Algorithmic Properties of Simplicial, Upper Bound and Middle Graphs (Q5301387) (← links)
