Dynamic matchings in left vertex weighted convex bipartite graphs

A left vertex weighted convex bipartite graph (LWCBG) is a bipartite graph G = ( X , Y , E ) in which the neighbors of each x ∈ X form an interval in Y where Y is linearly ordered, and each x ∈ X has an associated weight. This paper considers the problem of maintaining a maximum weight matching in a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization Jg. 32; H. 1; S. 25 - 50
Hauptverfasser:	Zu, Quan, Zhang, Miaomiao, Yu, Bin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.07.2016
Schlagworte:	Combinatorics Convex and Discrete Geometry Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Theory of Computation Dynamic matching BST Alternating path Implicit representation Matroid Weighted convex bipartite graph
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!