eBook
When MIS and Maximal Matching are Easy in the Congested Clique
| Τίτλος: | When MIS and Maximal Matching are Easy in the Congested Clique |
|---|---|
| Συγγραφείς: | Censor-Hillel, KerenAff10, Even, TomerAff10, Flin, MaximeAff11, Halldórsson, Magnús M.Aff11 |
| Συνεισφορές: | Goos, Gerhard, Series EditorAff1, Aff3, Hartmanis, Juris, Founding EditorAff2, Bertino, Elisa, Editorial Board MemberAff4, Gao, Wen, Editorial Board MemberAff5, Steffen, Bernhard, Editorial Board MemberAff6, Yung, Moti, Editorial Board MemberAff7, Schmid, Ulrich, editorAff8, Kuznets, Roman, editorAff9 |
| Πηγή: | Structural Information and Communication Complexity : 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings. 15671:194-210 |
| Βάση Δεδομένων: | Springer Nature eBooks |
| ISBN: | 9783031917356 9783031917363 |
|---|---|
| DOI: | 10.1007/978-3-031-91736-3_12 |