Pages that link to "Item:Q3745302"
From MaRDI portal
The following pages link to Efficient algorithms for finding maximum matching in graphs (Q3745302):
Displaying 50 items.
- Parallel approximation algorithms for maximum weighted matching in general graphs (Q294847) (← links)
- A two-stage hardware scheduler combining greedy and optimal scheduling (Q436901) (← links)
- Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model (Q582123) (← links)
- On the complexity of core, kernel, and bargaining set (Q650525) (← links)
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes (Q764341) (← links)
- Quantum algorithms for matching problems (Q839634) (← links)
- Incremental assignment problem (Q865928) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- On the construction of all shortest node-disjoint paths in star networks (Q903371) (← links)
- Parameterized lower bound and inapproximability of polylogarithmic string barcoding (Q941834) (← links)
- The maximum fuzzy weighted matching models and hybrid genetic algorithm (Q945410) (← links)
- Error-free milestones in error prone measurements (Q985011) (← links)
- Stabilizing maximum matching in bipartite networks (Q1014349) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Efficient labelling algorithms for the maximum noncrossing matching problem (Q1315996) (← links)
- Persistency in maximum cardinality bipartite matchings (Q1332944) (← links)
- From Hall's matching theorem to optimal routing on hypercubes (Q1569034) (← links)
- Graph-theoretic multisample tests of equality in distribution for high dimensional data (Q1659474) (← links)
- Trapezoidal matrices and the bottleneck assignment problem (Q1805450) (← links)
- A flexible formal framework for masking/demasking faults (Q1827146) (← links)
- Finding a maximum matching in a permutation graph (Q1902306) (← links)
- A 3/2-approximation for big two-bar charts packing (Q2045041) (← links)
- On the induced matching problem in Hamiltonian bipartite graphs (Q2059914) (← links)
- Simplified group activity selection with group size constraints (Q2121462) (← links)
- Matching and scheduling of student-company-talks for a university it-speed dating event (Q2167666) (← links)
- Tree-based cryptographic access control (Q2167711) (← links)
- Faster algorithm for finding maximum 1-restricted simple 2-matchings (Q2169943) (← links)
- Minimum cost stability in exchange networks (Q2279739) (← links)
- An efficient construction of one-to-many node-disjoint paths in folded hypercubes (Q2443019) (← links)
- Ontology-based concept similarity in formal concept analysis (Q2509212) (← links)
- The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching (Q2654962) (← links)
- A Fast Perfect-Matching Algorithm in Random Graphs (Q3360222) (← links)
- Angle Optimization in Target Tracking (Q3512448) (← links)
- (Q4418670) (← links)
- (Q4536416) (← links)
- A Faster Algorithm for Maximum Induced Matchings on Circle Graphs (Q4585063) (← links)
- A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs (Q4623143) (← links)
- AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ (Q4820048) (← links)
- Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs (Q5025046) (← links)
- Minimum weight euclidean matching and weighted relative neighborhood graphs (Q5060141) (← links)
- (Q5214203) (← links)
- PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS (Q5248991) (← links)
- ALL SEPARATING TRIANGLES IN A PLANE GRAPH CAN BE OPTIMALLY "BROKEN" IN POLYNOMIAL TIME (Q5249048) (← links)
- (Q5289457) (← links)
- An Exact Distribution-Free Test Comparing Two Multivariate Distributions based on Adjacency (Q5473052) (← links)
- Partial ML estimation for spatial autoregressive nonlinear probit models with autoregressive disturbances (Q5860989) (← links)
- The difficulty of beating the Taxman (Q6064847) (← links)
- Heuristic sequencing methods for time optimal tracking of nested, open and closed paths (Q6084144) (← links)
- A graph-theoretic barcode ordering model for linked-reads (Q6487642) (← links)
- FLEX: a fast and light-weight learned index for \(k\)NN search in high-dimensional space (Q6546031) (← links)
