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:3680870
Jump to:navigation, search

zbMath0566.05047MaRDI QIDQ3680870

Ernst W. Mayr, Thomas H. Spencer

Publication date: 1984


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

zbMATH Keywords

weighted graphsefficient algorithmmaximum weightnode weights


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items (8)

Weighted matching with vertex weights: An application to scheduling training sessions in NASA space shuttle cockpit simulators ⋮ Matching numbers in fuzzy graphs ⋮ Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Fast Dynamic Weight Matchings in Convex Bipartite Graphs ⋮ A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs ⋮ Weighted matching as a generic pruning technique applied to optimization constraints ⋮ A \(2/3\)-approximation algorithm for vertex-weighted matching ⋮ Approximation algorithms in combinatorial scientific computing




This page was built for publication:

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