All maximal independent sets and dynamic dominance for sparse graphs
From MaRDI portal
Publication:2930264
DOI10.1145/1597036.1597042zbMath1298.05299arXivcs/0407036OpenAlexW3139242982WikidataQ59409898 ScholiaQ59409898MaRDI QIDQ2930264
No author found.
Publication date: 18 November 2014
Published in: (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0407036
No records found.
No records found.
Related Items (2)
Simultaneously load balancing for every p-norm, with reassignments ⋮ On the computation of fixed points in Boolean networks
This page was built for publication: All maximal independent sets and dynamic dominance for sparse graphs
