Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4145830

From MaRDI portal
Publication:3476747
Jump to:navigation, search

zbMATH Open0698.94012MaRDI QIDQ3476747FDOQ3476747


Authors: S. Yu. Loshkareva Edit this on Wikidata


Publication date: 1988



Title of this publication is not available (Why is that?)



Recommendations

  • On a class of packet-switching networks on an infinite graph
  • Some complexity results about packet radio networks (Corresp.)
  • Bounds to Complexities of Networks for Sorting and for Switching
  • Upper bound of network capacity and a static optimal packet routing strategy
  • scientific article; zbMATH DE number 4068275
  • On the number of broadcast schemes in networks
  • On a Network Generalization of the Minmax Theorem
  • scientific article; zbMATH DE number 3848612
  • Network encoding complexity: exact values, bounds, and inequalities


zbMATH Keywords

cybernetics\(\Omega\)-networks


Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)







This page was built for publication:

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3476747&oldid=16812531"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 21:34. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki