The graph-bin packing problem
From MaRDI portal
Recommendations
Cites work
- A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
- An Algorithm for Subgraph Isomorphism
- Channel assignment on graphs of bounded treewidth
- Circular chromatic number: A survey
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Labelling Graphs with a Condition at Distance 2
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On Bin Packing with Conflicts
- On the span in channel assignment problems: Bounds, computing and counting
- On-line and first fit colorings of graphs
- Randomized online graph coloring
- Scheduling with incompatible jobs
Cited in
(11)- The path set packing problem
- Bin-packing and matchings in threshold graphs
- Locality-preserving allocations problems and coloured bin packing
- Batched bin packing revisited
- New models of graph-bin packing
- Bin packing with colocations
- Connected bin packing problem on traceable graphs
- Graph coloring models and metaheuristics for packing applications
- The mixed vertex packing problem.
- Induced graph packing problems
- Constructing generalized suffix trees on distributed parallel platforms
This page was built for publication: The graph-bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3224960)
