OurBigBook About$ Donate
 Sign in Sign up

Maximum-weight matching documentation by NetworkX

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-24  0 By others on same topic  0 Discussions Create my own version
networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.matching.max_weight_matching.html
The max_weight_matching documentation specifies unrestricted-weight optimization by default, distinguishes the optional maximum-cardinality constraint, and gives cubic running time in the number of vertices. Its notes distinguish exact integer arithmetic from possible precision effects for floating-point weights. These details specify the maximum-weight matching subroutine needed for minimum-weight edge cover by matching savings.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (3)

  • Minimum-weight edge cover by matching savings
  • Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / iii / Solution
  • Past exam of the computer science course of the University of Oxford / 2023 / Combinatorial optimisation / 3 / d / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook