Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

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

zbMath0812.68047MaRDI QIDQ3994373

No author found.

Publication date: 23 January 1993


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

matchingOptimizationshortest pathsnetwork flowsassignmentFortran codesNetworkoptimal spanning trees


Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Parallel algorithms in computer science (68W10)


Related Items (3)

Quantifying human brain connectivity from diffusion tensor MRI ⋮ The selective travelling salesman problem ⋮ Algorithms and codes for dense assignment problems: The state of the art




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3994373&oldid=13493227"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 15:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki