A remark on maximum matching of line graphs

DOI10.1016/S0012-365X(97)00103-9zbMath0886.05095MaRDI QIDQ1377734

Shuji Shiraishi

Publication date: 26 January 1998

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

zbMATH Keywords

line graphmaximum matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Chain packing in graphs
• Constructing a perfect matching is in random NC
• A random NC algorithm for depth first search
• An Efficient Parallel Biconnectivity Algorithm
• An O(logn) parallel connectivity algorithm