scientific article; zbMATH DE number 4144006
From MaRDI portal
Publication:3475285
Recommendations
- A coloring problem for weighted graphs
- Weighted graph colorings
- Graph colouring algorithms
- A branch-and-cut algorithm for graph coloring
- An algorithm for coloring some perfect graphs
- Weighted-set graph colorings
- An algorithm for constructing a weight-controlled subset and its application to graph coloring problem
- scientific article; zbMATH DE number 4210190
- scientific article; zbMATH DE number 17824
Cited in
(14)- Models and heuristic algorithms for a weighted vertex coloring problem
- Weighted coloring: further complexity and approximability results
- An algorithm for constructing a weight-controlled subset and its application to graph coloring problem
- Solving the minimum weighted integer coloring problem
- Load balancing by graph coloring, an algorithm
- Solving the minimum-weighted coloring problem
- Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
- scientific article; zbMATH DE number 4132184 (Why is no real title available?)
- A problem in graph theory arising from air traffic control
- A new polynomial-time algorithm for the maximum weighted (?(G) ? 1)-coloring problem in comparability graphs
- New lower bounds on the weighted chromatic number of a graph
- Theoretical Computer Science
- On new algorithmic techniques for the weighted vertex coloring problem
- The performance of an upper bound on the fractional chromatic number of weighted graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3475285)
