Pages that link to "Item:Q5682014"
From MaRDI portal
The following pages link to An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014):
Displaying 50 items.
- A fast algorithm to construct a representation for transversal matroids (Q263073) (← links)
- Optimum matchings in weighted bipartite graphs (Q265439) (← links)
- Eccentricity, center and radius computations on the cover graphs of distributive lattices with applications to stable matchings (Q266919) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Exact and approximate computational geometry solutions of an unrestricted point set stereo matching problem (Q287251) (← links)
- Distinguishing and classifying from \(n\)-ary properties (Q288890) (← links)
- A polynomial algorithm for the extendability problem in bipartite graphs (Q293170) (← links)
- A polynomial time solvable instance of the feasible minimum cover problem (Q293433) (← links)
- A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph (Q299417) (← links)
- Parameterized tractability of the maximum-duo preservation string mapping problem (Q306271) (← links)
- A note on the complexity of the causal ordering problem (Q309924) (← links)
- Fast domino tileability (Q312152) (← links)
- Enhancing complex network controllability by minimum link direction reversal (Q315957) (← links)
- Convex transversals (Q390129) (← links)
- On testing monomials in multivariate polynomials (Q391220) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Finding all maximally-matchable edges in a bipartite graph (Q418005) (← links)
- Optimizing restriction site placement for synthetic genomes (Q418177) (← links)
- The class cover problem with boxes (Q419500) (← links)
- Communication and energy efficient routing protocols for single-hop radio networks (Q433469) (← links)
- A simple reduction from maximum weight matching to maximum cardinality matching (Q456169) (← links)
- Implicit computation of maximum bipartite matchings by sublinear functional operations (Q477185) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- Dulmage-Mendelsohn canonical decomposition as a generic pruning technique (Q487628) (← links)
- Weighted matching as a generic pruning technique applied to optimization constraints (Q490152) (← links)
- Vulnerability and controllability of networks of networks (Q506872) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Iterated local search with Trellis-neighborhood for the partial Latin square extension problem (Q525111) (← links)
- Level scheduling under limited resequencing flexibility (Q539476) (← links)
- Maximum bipartite flow in networks with adaptive channel width (Q541660) (← links)
- The extended global cardinality constraint: an empirical survey (Q543616) (← links)
- Approximate string matching with stuck address bits (Q551176) (← links)
- The directed Hausdorff distance between imprecise point sets (Q553353) (← links)
- On protein structure alignment under distance constraint (Q553356) (← links)
- A combinatorial study of the rigidity of planar structures (Q581093) (← links)
- Computing simple circuits from a set of line segments (Q583232) (← links)
- Domino tilings and related models: Space of configurations of domains with holes (Q596048) (← links)
- The complexity of computing the permanent (Q600247) (← links)
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- Matchability and \(k\)-maximal matchings (Q617892) (← links)
- Covering directed graphs by in-trees (Q626455) (← links)
- Noisy colored point set matching (Q628337) (← links)
- Scheduling jobs with equal processing times subject to machine eligibility constraints (Q633548) (← links)
- On the asymptotic optimality of an algorithm for solving the maximum \(m\)-PSP in a multidimensional Euclidean space (Q643801) (← links)
- Iterative improvement of vertex covers (Q672405) (← links)
- Complexities of efficient solutions of rectilinear polygon cover problems (Q676264) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
