Dynamic matchings in left vertex weighted convex bipartite graphs
From MaRDI portal
Publication:328682
DOI10.1007/S10878-015-9890-XzbMATH Open1354.90161OpenAlexW2018678447MaRDI QIDQ328682FDOQ328682
Miaomiao Zhang, Quan Zu, Bin Yu
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Matchings in node-weighted convex bipartite graphs
- Efficiency of a Good But Not Linear Set Union Algorithm
- A linear-time algorithm for a special case of disjoint set union
- TWO THEOREMS IN GRAPH THEORY
- Independent Domination on Tree Convex Bipartite Graphs
- Maximum matching in a convex bipartite graph
- 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
- Dynamic Matchings in Left Weighted Convex Bipartite Graphs
- Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
- Dynamic Matchings in Convex Bipartite Graphs
- Optimal assignments in an ordered set: An application of matroid theory
Cited In (2)
This page was built for publication: Dynamic matchings in left vertex weighted convex bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q328682)
