ISSN:
1572-9125
Keywords:
F.2.2
;
G.2.2
;
Data structures
;
cograph
;
maximum matching problem
;
tree
Source:
Springer Online Journal Archives 1860-2000
Topics:
Mathematics
Notes:
Abstract In this paper, we develop a sequential algorithm for the maximum matching problem on cographs. The input is a parse tree of some cograph. The time complexity of our algorithm is linear.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01990526
Permalink