scientific article; zbMATH DE number 1953189
From MaRDI portal
Publication:4414635
zbMath1024.05501MaRDI QIDQ4414635
Publication date: 25 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2570/25700034.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (8)
Disconnected matchings ⋮ Graph matching problems and the NP-hardness of sortedness constraints ⋮ Weighted connected matchings ⋮ Multitasking Capacity: Hardness Results and Improved Constructions ⋮ Disconnected matchings ⋮ Improvements of the theorem of Duchet and Meyniel on Hadwiger's conjecture ⋮ Connected matchings in chordal bipartite graphs ⋮ Independent packings in structured graphs
This page was built for publication:
