Submodular percolation
From MaRDI portal
Publication:3583294
DOI10.1137/07069078XzbMATH Open1198.90378OpenAlexW2914356825MaRDI QIDQ3583294FDOQ3583294
Authors: Peter Winkler, Graham Brightwell
Publication date: 27 August 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/07069078x
Recommendations
Programming involving graphs or networks (90C35) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Search theory (90B40) Modular lattices, Desarguesian lattices (06C05)
Cited In (9)
- A NOTE ON SUBMODULAR FUNCTIONS ON DISTRIBUTIVE LATTICES
- Scheduling of Non-Colliding Random Walks
- Complete submodularity characterization in the comparative independent cascade model
- Submodular containment is hard, even for networks
- Computing Optimal Homotopies over a Spiked Plane with Polygonal Boundary
- Lattice of cubes
- Avoidance couplings on non‐complete graphs
- How to walk your dog in the mountains with no magic leash
- Constructing monotone homotopies and sweepouts
This page was built for publication: Submodular percolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583294)