Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law

DOI10.1007/BF02742291zbMATH Open0966.68157MaRDI QIDQ1582925FDOQ1582925

Authors: G. S. Finin 

Publication date: 16 October 2000

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Recommendations

• Elimination of unknown flows running along intermediate and terminal subgraphs
• Methods of finding dynamic flows in networks obeyed generalized Kirchhoff's law
• The flows in nets with generalized conservation principle
• scientific article; zbMATH DE number 892021
• scientific article; zbMATH DE number 1537495

zbMATH Keywords

networksflowsintermediate subgraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Title not available (Why is that?)
• Dynamic network flows for generalized Kirchhoff law
• The method of elimination of unknowns for systems of linear inequalities with graph structure

Cited In (3)

• The flows in nets with generalized conservation principle
• Elimination of unknown flows running along intermediate and terminal subgraphs
• Methods of finding dynamic flows in networks obeyed generalized Kirchhoff's law

This page was built for publication: Method of elimination of a group of unknown flows in networks with the generalized Kirchhoff law

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