Parker R. Gary

R. Gary Parker

Information about the author R. Gary Parker will soon be added to the site.
Found 4 papers in total
A graph approximation heuristic for the vertex cover problem on planar graphs
A graph approximation heuristic for the vertex cover problem on planar graphs
1994
The vertex cover problem is hard in general and remains so on planar graphs. On the...
On Halin subgraphs and supergraphs
On Halin subgraphs and supergraphs
1995
In this paper, the authors present two complexity results. The first pertains to the...
A cubic algorithm for the directed Eulerian subgraph problem
A cubic algorithm for the directed Eulerian subgraph problem
1991
Given a directed graph G(V,A) with arcs weighted as w:A⇒Z, the authors seek a...
Algorithms for recognition of regular properties and decomposition of recursive graph families
Algorithms for recognition of regular properties and decomposition of recursive graph families
1991
This paper focuses on two themes within the broad context of recursively definable...
Papers per page: