Maximum matching in a convex bipartite graph

Cited in

(65)

Mutual exclusion scheduling with interval graphs or related classes. I
Algorithms for maximum independent set in convex bipartite graphs
On-line updating of solutions to a class of matroid intersection problems
A fast bipartite network flow algorithm for selective assembly
On the complexity of the k-chain subgraph cover problem
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
Parallel maximum independent set in convex bipartite graphs
Recognizing interval digraphs and interval bigraphs in polynomial time
The maximum deviation just-in-time scheduling problem.
Biconvex graphs: Ordering and algorithms
Constraint programming and operations research
A short note on the complexity of computing strong pathbreadth
Finding maximum edge bicliques in convex bipartite graphs
Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time
A linear time algorithm for maximum matchings in convex, bipartite graphs
A type of algebraic structure related to sets of intervals
Maximum matching in almost linear time on graphs of bounded clique-width
Linear-time algorithms for maximum-weight induced matchings and minimum chain covers in convex bipartite graphs
Matching methods for observational studies derived from large administrative databases
Rejoinder: Matching methods for observational studies derived from large administrative databases
The \(b\)-\textsc{Matching} problem in distance-hereditary graphs and beyond
Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs
Computing maximum non-crossing matching in convex bipartite graphs
Tractable connected domination for restricted bipartite graphs
Minimizing variation of production rates in just-in-time systems: A survey
On compiling structured CNFs to OBDDs
Sparse Monge matrices arising from scheduling problems
Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem
The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes
Circular convex bipartite graphs: feedback vertex set
Fast dynamic weight matchings in convex bipartite graphs
Circular convex bipartite graphs: feedback vertex sets
On compiling structured CNFs to OBDDs
Dynamic matchings in left vertex weighted convex bipartite graphs
Complexity of domination, Hamiltonicity and treewidth for tree convex bipartite graphs
A note on bottleneck product rate variation problem with square-deviation objective
Feedback vertex sets on restricted bipartite graphs
A two-stage hardware scheduler combining greedy and optimal scheduling
Maximum Edge Bicliques in Tree Convex Bipartite Graphs
Reformulating linear programs with transportation constraints-With applications to workforce scheduling
AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER
AN OPTIMAL PARALLEL MATCHING ALGORITHM FOR A CONVEX BIPARTITE GRAPH ON A MESH-CONNECTED COMPUTER∗
On adaptive algorithms for maximum matching
Matchings in connection with ground delay program planning
On the complexity of the maximum biplanar subgraph problem
Graph classes and the switch Markov chain for matchings
The risk of maternal complications after Cesarean delivery: near-far matching for instrumental variables study designs with large observational datasets
Solving problems on generalized convex graphs via mim-width
Approximation hardness of domination problems on generalized convex graphs
Efficient parallel algorithms for doubly convex-bipartite graphs
Total domination and open packing in some subclasses of bipartite graphs
Happy set problems on cubic graphs and convex bipartite graphs
Linear-time algorithm for the paired-domination problem in convex bipartite graphs
Visualization of bipartite graphs in limited window size
Radio labeling of biconvex split graphs
Consensus algorithms for the generation of all maximal bicliques
Counting independent sets in tree convex bipartite graphs
Connected partitions via connected dominating sets
An 0(n log n) algorithm for the convex bipartite matching problem
LP based heuristics for the multiple knapsack problem with assignment restrictions
Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
On orthogonal ray trees
Probabilistic single processor scheduling
On complexity of special maximum matchings constructing

This page was built for publication: Maximum matching in a convex bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5574593)