Tree decompositions meet induced matchings: beyond Max Weight Independent Set
zbMatharXiv:2402.15834MaRDI QIDQ6523247
Kenny Štorgel, Peter Mursic, Paloma T. Lima, Karolina Okrasa, Martin Milanič, Paweł Rzążewski
Publication date: 1 January 1
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
This page was built for publication: Tree decompositions meet induced matchings: beyond Max Weight Independent Set
