The following pages link to R. G. Parker (Q221669):
Displaying 23 items.
- Guaranteed performance heuristics for the bottleneck traveling salesman problem (Q786658) (← links)
- A cubic algorithm for the directed Eulerian subgraph problem (Q806684) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families (Q1186787) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- On Halin subgraphs and supergraphs (Q1343152) (← links)
- On minimum cuts and the linear arrangement problem (Q1570828) (← links)
- On the complexity of certain completion problems (Q2716514) (← links)
- Exact boundary condition perturbation for eigensolutions of the wave equation (Q2880779) (← links)
- (Q3139275) (← links)
- On finding spanning eulerian subgraphs (Q3703676) (← links)
- An efficiently solvable case of the minimum weight equivalent subgraph problem (Q3706869) (← links)
- On multiple steiner subgraph problems (Q3786300) (← links)
- Deterministic Dcomposition of Recursive Graph Classes (Q3985535) (← links)
- (Q4040299) (← links)
- (Q4301895) (← links)
- (Q4393287) (← links)
- (Q4404021) (← links)
- The linear arrangement problem on recursively constructed graphs (Q4432765) (← links)
- (Q4864756) (← links)
- A Precedence Graph Algorithm for the Shop Scheduling Problem (Q5618270) (← links)
- On completing latin squares (Q5951961) (← links)
