Lattice flows in networks

DOI10.1134/S003294601601004XzbMath1416.94084OpenAlexW2492248287MaRDI QIDQ522926

Vadim D. Shmatkov

Publication date: 19 April 2017

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s003294601601004x

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Neural networks for/in biological studies, artificial life and related topics (92B20) Structure and representation theory of distributive lattices (06D05) Applications of design theory to circuits and networks (94C30) Relational systems, laws of composition (08A02) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural and algorithmic properties for parametric minimum cuts
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• Combinatorial theory.
• Powers of matrices over distributive lattices -- a review
• The Lattice Structure of Flow in Planar Graphs
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• Minimizing a Submodular Function on a Lattice
• Incidence algebras over lattices
• A Theorem on Boolean Matrices

This page was built for publication: Lattice flows in networks