Publication | Closed Access

Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems

Mathematical ProgrammingMaximum MatchingsNetwork ScienceGraph TheoryEngineeringExtremal Graph TheoryConvex Bipartite GraphsMatching TechniqueNetwork AnalysisEducationComputational ComplexityExtremal CombinatoricsGraph AlgorithmComputer ScienceDiscrete MathematicsCombinatorial OptimizationGraph MatchingEfficient Algorithms