Filters. The Number of Channels That Can Clog in a Network

DOI10.1137/080723703zbMath1166.76052OpenAlexW1985568116MaRDI QIDQ3631939

Guido Kampel, Guillermo H. Goldsztein

Publication date: 22 June 2009

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/080723703

zbMATH Keywords

upper boundporous mediaplanar graphsEuler formula

Mathematics Subject Classification ID

Applications of graph theory (05C90) Flows in porous media; filtration; seepage (76S05) Suspensions (76T20)

This page was built for publication: Filters. The Number of Channels That Can Clog in a Network