Dynamic matchings in left vertex weighted convex bipartite graphs

DOI10.1007/s10878-015-9890-xzbMath1354.90161OpenAlexW2018678447MaRDI QIDQ328682

Mohammad Hasan, M. Dambrine

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9890-x

zbMATH Keywords

matroidalternating pathBSTdynamic matchingimplicit representationweighted convex bipartite graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for a special case of disjoint set union
• Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs
• Independent Domination on Tree Convex Bipartite Graphs
• Matchings in Node-Weighted Convex Bipartite Graphs
• Dynamic Matchings in Left Weighted Convex Bipartite Graphs
• TWO THEOREMS IN GRAPH THEORY
• Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
• Dynamic Matchings in Convex Bipartite Graphs
• Efficiency of a Good But Not Linear Set Union Algorithm
• Maximum matching in a convex bipartite graph
• Optimal assignments in an ordered set: An application of matroid theory

This page was built for publication: Dynamic matchings in left vertex weighted convex bipartite graphs