Reconfiguration of maximum weight \(b\)-matchings in a graph
From MaRDI portal
Publication:2412417
DOI10.1007/978-3-319-62389-4_24zbMath1434.68360OpenAlexW2726835112MaRDI QIDQ2412417
Naonori Kakimura, Takehiro Ito, Yusuke Kobayashi, Naoyuki Kamiyama, Yoshio Okamoto
Publication date: 23 October 2017
Full work available at URL: https://doi.org/10.1007/978-3-319-62389-4_24
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Signed and weighted graphs (05C22)
Related Items
Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs, Reconfiguration of maximum-weight \(b\)-matchings in a graph, Unnamed Item, Introduction to reconfiguration