The average size of maximal matchings in graphs

DOI10.1007/S10878-024-01144-8MaRDI QIDQ6497032

Sébastien Bonte, Gauvain Devillez, Alain Hertz, Hadrien Mélot

Publication date: 6 May 2024

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Greedy matching: guarantees and limitations
• The average performance of the greedy matching algorithm
• The average size of matchings in graphs
• Counting maximal matchings in linear polymers
• Edge Dominating Sets in Graphs
• Randomized greedy matching
• Randomized greedy matching. II
• Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs
• The Number of Maximal Matchings in Polyphenylene Chains
• Counting Domineering Positions
• Maximal matchings in polyspiro and benzenoid chains
• Greedy Matching in Bipartite Random Graphs

This page was built for publication: The average size of maximal matchings in graphs