Forgetting Alternation and Blossoms: A New Framework for Fast Matching Augmentation and Its Applications to Sequential/Distributed/Streaming Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Izumi, Taisuke, Kitamura, Naoki, Yamaguchi, Yutaro
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Distributed, Parallel, and Cluster Computing Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2511.08210