Pages that link to "Item:Q5682014"

The following pages link to An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014):

Displaying 50 items.

• Geometric stable roommates (Q976079) (← links)
• A new fast heuristic for labeling points (Q987799) (← links)
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph (Q990080) (← links)
• AllDifferent-based filtering for subgraph isomorphism (Q991022) (← links)
• Two-factors in orientated graphs with forbidden transitions (Q998498) (← links)
• Approximating largest convex hulls for imprecise points (Q1002103) (← links)
• The stable marriage problem with master preference lists (Q1005239) (← links)
• Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
• On the \(k\)-orientability of random graphs (Q1024456) (← links)
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
• List edge multicoloring in graphs with few cycles (Q1029053) (← links)
• Approximation algorithms for hard variants of the stable marriage and hospitals/residents problems (Q1029707) (← links)
• Optimal movement of mobile sensors for barrier coverage of a planar region (Q1040594) (← links)
• Efficient bounds for the stable set, vertex cover and set packing problems (Q1056763) (← links)
• Detection of structural inconsistency in systems of equations with degrees of freedom and its applications (Q1062429) (← links)
• Depth-first search is inherently sequential (Q1062456) (← links)
• Sensitivity analysis of an agricultural linear programming model (Q1062624) (← links)
• Concerning the achromatic number of graphs (Q1065819) (← links)
• On the complexity of a family of generalized matching problems (Q1068535) (← links)
• Lower bounds on monotone complexity of the logical permanent (Q1071001) (← links)
• Scaling algorithms for network problems (Q1079135) (← links)
• On gallery watchmen in grids (Q1087018) (← links)
• An O(n log n log log n) parallel maximum matching algorithm for bipartite graphs (Q1091829) (← links)
• Bipartite permutation graphs (Q1092931) (← links)
• Recursive structure of S-matrices and an \(O(m^ 2)\) algorithm for recognizing sign solvability (Q1093326) (← links)
• The monotone circuit complexity of Boolean functions (Q1094870) (← links)
• On a scheduling problem where a job can be executed only by a limited number of processors (Q1104235) (← links)
• The general maximum matching algorithm of Micali and Vazirani (Q1105385) (← links)
• The discrete time-cost tradeoff problem revisited (Q1129886) (← links)
• Systems of distinct representatives for k families of sets (Q1135111) (← links)
• Degree switching operations in networks and large scale systems assignment problems (Q1139029) (← links)
• Maximum matchings and trees (Q1146984) (← links)
• On generalized matching problems (Q1149783) (← links)
• Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← links)
• Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs (Q1158444) (← links)
• The complexity of testing whether a graph is a superconcentrator (Q1162529) (← links)
• An algorithm for matrix symmetrization (Q1166891) (← links)
• The complexity of computing metric distances between partitions (Q1170849) (← links)
• Depth-first search and the vertex cover problem (Q1171390) (← links)
• The isomorphism problem for classes of graphs closed under contraction (Q1175965) (← links)
• The translation square map and approximate congruence (Q1182089) (← links)
• Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
• New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
• Branch-and-bound algorithms for the multi-product assembly line balancing problem (Q1194733) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Minimum perfect bipartite matchings and spanning trees under categorization (Q1201102) (← links)
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees (Q1201267) (← links)
• Finding a maximum matching in a circular-arc graph (Q1209984) (← links)
• A note on degree-constrained star subgraphs of bipartite graphs (Q1233725) (← links)
• Linear algorithms for testing the sign stability of a matrix and for finding Z-maximum matchings in acyclic graphs (Q1234553) (← links)