Minimum-maximal matching in series-parallel graphs
type: Item
instance of: scholarly article
title: Minimum-maximal matching in series-parallel graphs
zbMATH Open document ID: 0637.90094
DOI: 10.1016/0377-2217(88)90258-5
author: R. G. Parker
author: Michael B. Richey
published in: European Journal of Operational Research
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 4039666
zbMATH Keywords: undirected graph
zbMATH Keywords: minimum weight subset
zbMATH Keywords: matching
zbMATH Keywords: minimum-maximal matching
zbMATH Keywords: series-parallel graphs
MaRDI profile type: Publication
full work available at URL: 0377-2217(88)90258-5
OpenAlex ID: W2040166238
cites work: A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
cites work: Topology of series-parallel networks
cites work: Paths, Trees, and Flowers
cites work: Parallel concepts in graph theory
cites work: The biparticity of a graph
cites work: A linear algorithm for the domination number of a series-parallel graph
cites work: Q3924253
cites work: Decomposition of Finite Graphs Into Forests
cites work: An efficiently solvable case of the minimum weight equivalent subgraph problem
cites work: On finding spanning eulerian subgraphs
cites work: Linear-time computability of combinatorial problems on series-parallel graphs
cites work: Steiner trees, partial 2–trees, and minimum IFI networks
cites work: Steiner trees, connected domination and strongly chordal graphs
cites work: Linear-time computation of optimal subgraphs of decomposable graphs
cites work: Edge Dominating Sets in Graphs
description: scientific article; zbMATH DE number 4039666