Pages that link to "Item:Q1921260"
From MaRDI portal
The following pages link to A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260):
Displaying 29 items.
- Dynamic matchings in left vertex weighted convex bipartite graphs (Q328682) (← links)
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- An 0(n log n) algorithm for the convex bipartite matching problem (Q792885) (← links)
- The maximum fuzzy weighted matching models and hybrid genetic algorithm (Q945410) (← links)
- The induced matching and chain subgraph cover problems for convex bipartite graphs (Q995582) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Algorithms for maximum independent set in convex bipartite graphs (Q1017904) (← links)
- A new matrix bandwidth reduction algorithm (Q1306383) (← links)
- Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits (Q1350298) (← links)
- Finding maximum edge bicliques in convex bipartite graphs (Q1759663) (← links)
- On some graphs with a unique perfect matching (Q1799576) (← links)
- A comment on ``A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems'' (Q1890955) (← links)
- Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs (Q2118390) (← links)
- The power of linear-time data reduction for maximum matching (Q2211355) (← links)
- Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031) (← links)
- Computing maximum non-crossing matching in convex bipartite graphs (Q2348053) (← links)
- Optimal point movement for covering circular regions (Q2354019) (← links)
- Routing equal-size messages on a slotted ring (Q2434298) (← links)
- Fast Dynamic Weight Matchings in Convex Bipartite Graphs (Q2946428) (← links)
- A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs (Q4561265) (← links)
- (Q5091230) (← links)
- The Power of Linear-Time Data Reduction for Maximum Matching (Q5111261) (← links)
- A Near-linear Time ε-Approximation Algorithm for Geometric Bipartite Matching (Q5133973) (← links)
- Matchings in connection with ground delay program planning (Q5191150) (← links)
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs (Q5232142) (← links)
- (Q5289457) (← links)
- Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b–Matching Problems in Nonbipartite Graphs (Q5383977) (← links)
- A near-linear time ε-approximation algorithm for geometric bipartite matching (Q5415489) (← links)
- Induced matchings in strongly biconvex graphs and some algebraic applications (Q6081912) (← links)