Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract)

DOI10.1007/978-3-030-17402-6_16MaRDI QIDQ2294050zbMATH OpenOpenAlexFDO

Authors Miguel Coviello Gonzalez, Marek Chrobak

Publication date 6 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-17402-6_16

zbMATH Keywords

algorithmsgraph theoryfluid mixinglab-on-chip

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Other nonclassical models of computation (68Q09)

Recommendations

• Towards a theory of mixing graphs: a characterization of perfect mixability
• Foundations of chaotic mixing
• Mixing and un-mixing by incompressible flows
• Maximal mixing by incompressible fluid flows
• A mapping approach for three-dimensional distributive mixing analysis

Cited in

(2)

• Mixing problems with many tanks
• Towards a theory of mixing graphs: a characterization of perfect mixability

This page was built for publication: Towards a theory of mixing graphs: a characterization of perfect mixability (extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294050)