## Real-Time Minimum Vertex Cover For Two-Terminal Series-Parallel Graphs (2000)

### Cached

### Download Links

- [www.cs.queensu.ca]
- [www.cs.queensu.ca]
- [ftp.qucis.queensu.ca]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the Thirteenth Conference on Parallel and Distributed Computing and Systems |

Citations: | 7 - 7 self |

### BibTeX

@INPROCEEDINGS{Nagy00real-timeminimum,

author = {Marius Nagy and Selim G. Akl},

title = {Real-Time Minimum Vertex Cover For Two-Terminal Series-Parallel Graphs},

booktitle = {Proceedings of the Thirteenth Conference on Parallel and Distributed Computing and Systems},

year = {2000},

pages = {526--534}

}

### OpenURL

### Abstract

Tree contraction is a powerful technique for solving a large number of graph problems on families of recursively definable graphs. The method is based on processing the parse tree associated with a member of such a family of graphs in a bottom-up fashion, such that the solution to the problem is obtained at the root of the tree. Sequentially, this can be done in linear time with respect to the size of the input graph. In parallel, efficient and even cost optimal tree contraction algorithms have also been developed. In this paper we show how the method can be applied to compute the cardinality of the minimum vertex cover of a two-terminal series-parallel graph. We then construct a real-time paradigm for this problem and show that in the new computational environment, a parallel algorithm is superior to the best possible sequential algorithm, in terms of the accuracy of the solution computed. Specifically, there are cases in which the solution produced by a parallel algorithm ...

### Citations

11804 |
Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, Johnson
- 1979
(Show Context)
Citation Context ...S a b c d Figure 5: A TTSP graph and its decomposition tree. the minimum covering set problem, is to find a covering set of minimum cardinality. For an arbitrary graph, this is an NP-complete problem =-=[9]-=-. In our case, however, the input to the problem is a TTSP graph and we are only interested to find the cardinality of the minimum covering set, or the best possible approximation of it. Under these r... |

122 |
Parallel tree contraction and its application
- Miller, Reif
- 1985
(Show Context)
Citation Context ...tices will always refer to the original series-parallel graph. Because of its widespread applicability, developing an efficient parallel tree contraction algorithm was very important. Miller and Reif =-=[19]-=- describe a deterministic algorithm which runs in O(log N) time with O(N) Exclusive-Read Exclusive-Write Parallel Random Access Machine (EREW PRAM) [2] processors. A single step of their algorithm use... |

120 |
The recognition of series parallel digraphs
- Valdes, Tarjan, et al.
- 1982
(Show Context)
Citation Context ...s denote either a series (S) or a parallel (P) connection. Both sequential and parallel algorithms for recognizing a series-parallel graph and obtaining its decomposition tree exist in the literature =-=[13, 23]-=-. 3 The minimum vertex cover problem Let G = (V; E) be a graph under the usual notation convention, where V represents the set of vertices and E the set of edges. A covering set of G is a subset C ` V... |

49 |
Optimal parallel evaluation of tree-structured computations by raking
- KOSARAJU, DELCHER
- 1988
(Show Context)
Citation Context ... a given tree is reduced to its 2 root. Since the original paper of Miller and Reif [19], a series of improved tree contraction algorithms have been developed. Gazit et al. [10], Kosaraju and Delcher =-=[15]-=-, and Abrahamson et al. [1] were all able to develop optimal, deterministic parallel algorithms for tree contraction on the EREW PRAM model, running in O(log N) time and using only O(N= log N) process... |

40 |
Linear-Time Computability of Combinatorial Problems on Series-Parallel Graphs
- Takamizawa, Nishizeki, et al.
- 1982
(Show Context)
Citation Context ...be fulfilled in order to evaluate the parse tree by applying a parallel tree contraction algorithm. For more details about these conditions, see [1]. 1.2 Contributions of this paper Takamizawa et al. =-=[21]-=- showed in a unified manner that for many combinatorial problems on graphs, including minimum vertex cover, there exist algorithms whose running time is linear in the size of the input, if the graphs ... |

25 | Parallel real-time optimization: Beyond speedup
- Akl, Bruda
- 1999
(Show Context)
Citation Context ...dlines on when the newly arrived data should be processed and incorporated into the solution computed so far. The kind of real-time paradigm constructed in this paper is similar to the one defined in =-=[4]-=- for another optimization problem in graph theory, namely the minimum spanning tree. The parallel algorithm will always be able to compute the exact cardinality of the minimum vertex cover for the inp... |

21 | A case study in real-time parallel computation: Correcting algorithms
- Bruda, Akl
- 2001
(Show Context)
Citation Context ...eal-time paradigm, where the data arrive as the algorithm proceeds. This is the basic idea underlying all real-time computations, regardless of the various particular characteristics each of them has =-=[3, 4, 5, 6, 7, 8, 16, 22]-=-. In our formulation of the paradigm, a subset of the input data is given at the beginning of the computation, and the rest arrive at regular intervals. The algorithm must then deal with the newly arr... |

18 | Optimal tree contraction in the EREW model
- GAZIT, MILLER, et al.
- 1988
(Show Context)
Citation Context ...t after O(log N) such steps a given tree is reduced to its 2 root. Since the original paper of Miller and Reif [19], a series of improved tree contraction algorithms have been developed. Gazit et al. =-=[10]-=-, Kosaraju and Delcher [15], and Abrahamson et al. [1] were all able to develop optimal, deterministic parallel algorithms for tree contraction on the EREW PRAM model, running in O(log N) time and usi... |

17 |
Parallel Processing in Industrial Real-Time Applications
- Lawson
- 1992
(Show Context)
Citation Context ...eal-time paradigm, where the data arrive as the algorithm proceeds. This is the basic idea underlying all real-time computations, regardless of the various particular characteristics each of them has =-=[3, 4, 5, 6, 7, 8, 16, 22]-=-. In our formulation of the paradigm, a subset of the input data is given at the beginning of the computation, and the rest arrive at regular intervals. The algorithm must then deal with the newly arr... |

14 | Parallel real-time numerical computation: Beyond speedup III
- Akl, Bruda
- 2000
(Show Context)
Citation Context ...eal-time paradigm, where the data arrive as the algorithm proceeds. This is the basic idea underlying all real-time computations, regardless of the various particular characteristics each of them has =-=[3, 4, 5, 6, 7, 8, 16, 22]-=-. In our formulation of the paradigm, a subset of the input data is given at the beginning of the computation, and the rest arrive at regular intervals. The algorithm must then deal with the newly arr... |

11 |
Real-Time Transaction Processing
- Thorin
- 1992
(Show Context)
Citation Context |

10 |
A methodology for constructing linear graph algorithms
- Wimer, Hedetniemi, et al.
- 1985
(Show Context)
Citation Context ...d the linearity of the previously published algorithms, predicted the existence of several thousand new linear time algorithms of this kind and provided a methodology for constructing any one of them =-=[24]-=-. The problem addressed in this paper is that of finding the cardinality of a minimum vertex cover, in the particular case of a two-terminal series-parallel graph. Furthermore, we define the problem i... |

9 |
Real-Time Database and Information Systems
- Bestavros, Fay-Wolfe, et al.
- 1997
(Show Context)
Citation Context |

9 |
Parallel recognition and decomposition of two terminal series parallel graphs
- He, Yesha
- 1987
(Show Context)
Citation Context ...s denote either a series (S) or a parallel (P) connection. Both sequential and parallel algorithms for recognizing a series-parallel graph and obtaining its decomposition tree exist in the literature =-=[13, 23]-=-. 3 The minimum vertex cover problem Let G = (V; E) be a graph under the usual notation convention, where V represents the set of vertices and E the set of edges. A covering set of G is a subset C ` V... |

8 |
A simple tree contraction algorithm
- Abrahamson, Dadoun, et al.
- 1989
(Show Context)
Citation Context ...its 2 root. Since the original paper of Miller and Reif [19], a series of improved tree contraction algorithms have been developed. Gazit et al. [10], Kosaraju and Delcher [15], and Abrahamson et al. =-=[1]-=- were all able to develop optimal, deterministic parallel algorithms for tree contraction on the EREW PRAM model, running in O(log N) time and using only O(N= log N) processors. These results provide ... |

8 | Parallel real-time cryptography: Beyond speedup II
- Akl, Bruda
- 2000
(Show Context)
Citation Context |

8 |
Efficient parallel algorithms for solving some tree problems
- He
- 1986
(Show Context)
Citation Context ...y O(N= log N) processors. These results provide efficient parallel algorithms for a large class of graph problems when the underlying graph is a member of a recursively definable family of graphs. He =-=[11]-=- applied the tree contraction scheme to solve the binary tree algebraic computation (BTAC) problem. It is then shown in [11] how several optimization problems for trees, such as for example, minimum c... |

7 |
Efficient parallel algorithms for series parallel graphs
- He
- 1991
(Show Context)
Citation Context ...ances of a B-ATC or T-ATC problem. Lin and Olariu [17] developed an optimal parallel matching algorithm for cographs, a result that was extended for some other classes of graphs by Parfenoff [18]. He =-=[12]-=- investigated the possibility of developing optimal parallel algorithms for another family of graphs: two-terminal series-parallel graphs. Using the already well established methodology based on tree ... |

5 | S.Olariu, An optimal parallel matching algorithm for cographs.J.Parallel
- Lin
- 1994
(Show Context)
Citation Context ...ifficult for general graphs, can be solved in logarithmic parallel time, if applied to a cograph represented as a parse tree, by reducing them to instances of a B-ATC or T-ATC problem. Lin and Olariu =-=[17]-=- developed an optimal parallel matching algorithm for cographs, a result that was extended for some other classes of graphs by Parfenoff [18]. He [12] investigated the possibility of developing optima... |

4 | Nonlinearity, maximization, and parallel real-time computation
- Akl
- 2000
(Show Context)
Citation Context |

3 |
Tree-Based Parallel Algorithm Design", Algorithmica 19
- Miller, Teng
- 1997
(Show Context)
Citation Context ...sfully applied to our particular problem. Although proving the satisfiability of these conditions is not very difficult, a more elegant justification is provided by a recent result of Miller and Teng =-=[20]-=-. According to their research, we are entitled to use a parallel tree contraction algorithm in our particular case due to the fact that the only operators used in the formulas that describe the series... |

2 |
An efficient parallel algorithm for maximum matching for some classes of graphs
- Parfenoff
- 1998
(Show Context)
Citation Context ...m to instances of a B-ATC or T-ATC problem. Lin and Olariu [17] developed an optimal parallel matching algorithm for cographs, a result that was extended for some other classes of graphs by Parfenoff =-=[18]-=-. He [12] investigated the possibility of developing optimal parallel algorithms for another family of graphs: two-terminal series-parallel graphs. Using the already well established methodology based... |

1 |
Parallel Computation: Models and Methods", Prentice-Hall, Upper Saddle River
- Akl
- 1997
(Show Context)
Citation Context ...n algorithm was very important. Miller and Reif [19] describe a deterministic algorithm which runs in O(log N) time with O(N) Exclusive-Read Exclusive-Write Parallel Random Access Machine (EREW PRAM) =-=[2]-=- processors. A single step of their algorithm uses two basic operations to reduce the current binary tree. The RAKE operation removes in parallel all leaves, while the COMPRESS operation is responsibl... |

1 |
Online computation, in: D.S. Hochbaum, Ed., "Approximation Algorithms for NP-Hard Problems
- Irani, Karlin
- 1997
(Show Context)
Citation Context ...dline on when a partial solution (or an approximation of it) must be produced, we will call such an algorithm a real-time algorithm (as opposed to an on-line algorithm, where no deadlines are imposed =-=[14]-=-). Not the whole data structure of the binary tree representing the decomposition tree of the original TTSP graph is available to the real-time algorithm at the outset. Initially, only a subtree with ... |

1 | An E cient Parallel Algorithm for Maximum Matching - Parfeno - 1998 |