Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs

DOI10.1007/978-3-642-45030-3_49zbMath1406.68090OpenAlexW854087466MaRDI QIDQ2872116

C. Gregory Plaxton

Publication date: 14 January 2014

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_49

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Auctions, bargaining, bidding and selling, and other market models (91B26) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Dynamic matchings in left vertex weighted convex bipartite graphs ⋮ Fast Dynamic Weight Matchings in Convex Bipartite Graphs ⋮ On orthogonal ray trees

This page was built for publication: Vertex-Weighted Matching in Two-Directional Orthogonal Ray Graphs