R
R. Gary Parker
Researcher at Georgia Institute of Technology
Publications - 25
Citations - 652
R. Gary Parker is an academic researcher from Georgia Institute of Technology. The author has contributed to research in topics: Pathwidth & Chordal graph. The author has an hindex of 12, co-authored 25 publications receiving 624 citations.
Papers
More filters
Journal ArticleDOI
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
TL;DR: A predicate calculus in which graph problems can be expressed and any problem possessing such an expression can be solved in linear time on any recursively constructed graph, once its decomposition tree is known.
Journal ArticleDOI
Guaranteed performance heuristics for the bottleneck travelling salesman problem
R. Gary Parker,Ronald L. Rardin +1 more
TL;DR: It is shown that no constant-performance, polynomial-time, nonexact algorithm can exist for problems with arbitrary costs unless P = NP, and further that, unless P + NP, no polynometric alternative can improve on this value.
Journal ArticleDOI
On multiple steiner subgraph problems
Michael B. Richey,R. Gary Parker +1 more
TL;DR: It is established that a class of Steiner subgraph-like problems are NP-complete on series-parallel graphs while remaining easy (even trivial) on trees.
Dissertation
The optimal linear arrangement problem: algorithms and approximation
Steven B. Horton,R. Gary Parker +1 more
Journal ArticleDOI
Solving problems on recursively constructed graphs
TL;DR: This article first describes some basic conceptual notions regarding the design of such fast algorithms, and then the coverage proceeds through several recursive graph classes, which include trees, series-parallel graphs, and treewidth-k graphs.