On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs (1994)
| Citations: | 2 - 0 self |
BibTeX
@MISC{Dahlhaus94onthe,
author = {Elias Dahlhaus and Marek Karpinski},
title = {On the Computational Complexity of Matching on Chordal and Strongly Chordal Graphs},
year = {1994}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we study the computational complexity (both sequential and parallel) of the maximum matching problem for chordal and strongly chordal graphs. We show that there is a linear time greedy algorithm for a maximum matching in a strongly chordal graph provided a strongly perfect elimination ordering is known. This algorithm can be also turned into a parallel algorithm. The technique used can be also extended for the multidimensional matching for chordal and strongly chordal graphs yielding the first polynomial time algorithms for these classes of graphs (the multidimensional matching is NPcomplete in general).
Citations
| 102 | The intersection graphs of subtrees in trees are exactly the chordal graphs - Gavril - 1974 |
| 33 | V.V.: Matching is as easy as matrix inversion. Combinatorica 7 - Mulmuley, Vazirani, et al. - 1987 |
| 32 | Characterizations of strongly chordal graphs, Discrete Mathematics - Farber - 1983 |
| 8 | Chordale graphen im besonderen hinblick auf parallele algorithmen, Habilitation thesis - Dahlhaus - 1991 |
| 7 | A Characterization of Rigid Circuit Graphs, Discrete Mathematics 9 - Bunemann - 1974 |
| 7 | Representation of a Finite Graph by a Set of - Boland, Lekkerkerker - 1962 |
| 5 | Two processor scheduling is - Hembold, Mayr - 1986 |
| 1 | A Characterization of Cocomparability Graphs and of Interval Graphs - Gilmore, Hoffman - 1964 |
| 1 | A General Class of Greedily Solvable - Queyranne, Spieksma, et al. - 1993 |
