Bin-packing and matchings in threshold graphs

DOI10.1016/0166-218X(94)00156-8zbMath0838.05083MaRDI QIDQ1900150

Gottfried Tinhofer

Publication date: 30 May 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

FFDmatchingthreshold graphsbin-packing problemstochastic convergencenumber of bins

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Cutting stock with no three parts per pattern: work-in-process and pattern minimization ⋮ On Structural Parameterizations of Graph Motif and Chromatic Number ⋮ An \(O(n^ 3)\) recognition algorithm for bithreshold graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bin-packing and matchings in threshold graphs