Distributed algorithms for finding small cycle covers in arbitrary networks
From MaRDI portal
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)
Recommendations
Cited in
(3)
This page was built for publication: Distributed algorithms for finding small cycle covers in arbitrary networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525689)