Pages that link to "Item:Q3718168"

The following pages link to An $O(EV\log V)$ Algorithm for Finding a Maximal Weighted Matching in General Graphs (Q3718168):

Displaying 18 items.

• Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
• A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
• Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
• 1-Approximation algorithm for bottleneck disjoint path matching (Q672495) (← links)
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
• Blossom V: A new implementation of a minimum cost perfect matching algorithm (Q734352) (← links)
• Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
• Walrasian equilibrium: Hardness, approximations and tractable instances (Q943867) (← links)
• Improved complexity bounds for location problems on the real line (Q1180820) (← links)
• An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787) (← links)
• On sum coloring of graphs (Q1811069) (← links)
• A genetic-based framework for solving (multi-criteria) weighted matching problems. (Q1811148) (← links)
• A framework for automated distributed implementation of component-based models (Q1938379) (← links)
• Maximum colored trees in edge-colored graphs (Q2311375) (← links)
• Blossom-Quad: A non-uniform quadrilateral mesh generator using a minimum-cost perfect-matching algorithm (Q2894944) (← links)
• Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
• Dynamic Matching Algorithms in Practice (Q5874529) (← links)
• A weight-scaling algorithm for \(f\)-factors of multigraphs (Q6046950) (← links)