Lattice flows in networks (Q522926)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Lattice flows in networks	scientific article

Statements

scholarly article

0 references

Lattice flows in networks (English)

0 references

Vadim D. Shmatkov

0 references

Problems of Information Transmission

0 references

publication date

19 April 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

0 references

0 references

Structural and algorithmic properties for parametric minimum cuts

0 references

Minimizing a Submodular Function on a Lattice

0 references

Combinatorial theory.

0 references

The matroids with the max-flow min-cut property

0 references

Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms

0 references

Matroids and multicommodity flows

0 references

The Lattice Structure of Flow in Planar Graphs

0 references

0 references

Incidence algebras over lattices

0 references

0 references

Powers of matrices over distributive lattices -- a review

0 references

A Theorem on Boolean Matrices

0 references

full work available at URL

https://doi.org/10.1134/s003294601601004x

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S003294601601004X

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:522926

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q522926&oldid=37421740"