Distributed maximal matching and maximal independent set on hypergraphs
From MaRDI portal
Cited in
(3)- Tight lower bounds in the supported LOCAL model
- Fine-grained complexity of multiple domination and dominating patterns in sparse graphs
- Fine-grained classification of detecting dominating patterns
This page was built for publication: Distributed maximal matching and maximal independent set on hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538630)