DFS is unsparsable and lookahead can help in maximal matching

DOI10.14232/ACTACYB.23.3.2018.10zbMATH Open1413.68074OpenAlexW2829649674WikidataQ129528173 ScholiaQ129528173MaRDI QIDQ4584659FDOQ4584659

Authors: Kitti Gelle, Szabolcs Iván 

Publication date: 3 September 2018

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.23.3.2018.10

Recommendations

• Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
• scientific article; zbMATH DE number 871918
• Orienting dynamic graphs, with applications to maximal matchings and adjacency queries
• Fully dynamic maximal matching in \(O(\log n)\) update time
• Simple Deterministic Algorithms for Fully Dynamic Maximal Matching

zbMATH Keywords

depth-first searchlookaheaddynamic graphsmaximal matchingsparse strong certificate

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: DFS is unsparsable and lookahead can help in maximal matching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584659)