An efficient scheme to solve two problems for two-terminal series parallel graphs

A scheme is presented to compute solutions for two problems for Two-Terminal Series Parallel graphs: 1. the Disjoint Path Matching problem, and 2. the Bottleneck Maximum Cardinality Matching problem. It is shown that solutions for both the problems can be obtained by combining the solutions of the s...

Full description

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 71; no. 1; pp. 9 - 15
Main Authors Datta, Alak Kumar, Sen, Ranjan Kumar
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 16.07.1999
Elsevier Science
Elsevier Sequoia S.A
Subjects
Algorithms
Combinatorics
Combinatorics. Ordered structures
Exact sciences and technology
Graph theory
Graphs
Mathematics
Parallel processing
Parallel random access machines
Path matching
Sciences and techniques of general use
Series parallel graphs
Studies
Series parallel graphs
Path matching
Graphs
Algorithms
Parallel random access machines
Binary tree algebraic computation problem
Binary tree
Decomposition
Graph theory
Algorithm
Bottleneck maximum cardinality matching
Two terminal series parallel graph
Online AccessGet full text

Cover

More Information
Summary:A scheme is presented to compute solutions for two problems for Two-Terminal Series Parallel graphs: 1. the Disjoint Path Matching problem, and 2. the Bottleneck Maximum Cardinality Matching problem. It is shown that solutions for both the problems can be obtained by combining the solutions of the subgraphs of the TTSP graph. This helps design O(n) time sequential algorithms for them.
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(99)00077-0