Pages that link to "Item:Q4554367"

The following pages link to Data Structures for Weighted Matching and Extensions to <i>b</i> -matching and <i>f</i> -factors (Q4554367):

Displaying 18 items.

• Hierarchical \(b\)-matching (Q831805) (← links)
• Euclidean maximum matchings in the plane -- local to global (Q832859) (← links)
• Minimum cost \(b\)-matching problems with neighborhoods (Q2082547) (← links)
• Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
• Maximum matching in almost linear time on graphs of bounded clique-width (Q2093582) (← links)
• Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
• Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers (Q2149100) (← links)
• The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond (Q2235279) (← links)
• An algorithmic approach to dual integrality of matching and extensions (Q2419581) (← links)
• Efficient and Adaptive Parameterized Algorithms on Modular Decompositions (Q5009620) (← links)
• Approximation algorithms in combinatorial scientific computing (Q5230524) (← links)
• Algorithms for Weighted Matching Generalizations II: <i>f</i>-factors and the Special Case of Shortest Paths (Q5858647) (← links)
• Blocking trails for \(f\)-factors of multigraphs (Q6046949) (← links)
• A weight-scaling algorithm for \(f\)-factors of multigraphs (Q6046950) (← links)
• On matchings, <i>T</i>‐joins, and arc routing in road networks (Q6065851) (← links)
• Improving a constructive heuristic for the general routing problem (Q6179705) (← links)
• Getting linear time in graphs of bounded neighborhood diversity (Q6599065) (← links)
• Euclidean maximum matchings in the plane -- local to global (Q6670815) (← links)