Maximum vertex-weighted matching in strongly chordal graphs

DOI10.1016/S0166-218X(97)00136-4zbMath0911.90334MaRDI QIDQ1392564

Sulamita Klein, Manoel B. Campêlo

Publication date: 28 July 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

matchinglinear time algorithmstrongly chordal graphvertex-weight

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Matching is as easy as matrix inversion
• Doubly Lexical Orderings of Matrices
• Three Partition Refinement Algorithms
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Maximum vertex-weighted matching in strongly chordal graphs