Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
From MaRDI portal
Publication:897950
DOI10.1016/J.TCS.2015.07.052zbMATH Open1332.05138OpenAlexW1056934671MaRDI QIDQ897950FDOQ897950
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.052
Recommendations
- Approximation algorithms for bandwidth consecutive multicolorings (extended abstract)
- Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract)
- Bandwidth consecutive multicolorings of graphs
- Improving a family of approximation algorithms to edge color multigraphs
- Efficient bounds on a branch and bound algorithm for graph colouration
- scientific article; zbMATH DE number 7650095
- Experimental and Efficient Algorithms
- An asymptotic approximation scheme for multigraph edge coloring
- An asymptotic approximation scheme for multigraph edge coloring
- Approximation algorithms for multicoloring planar graphs and powers of square and triangular meshes
Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Introduction to algorithms
- Fibonacci heaps and their uses in improved network optimization algorithms
- Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling
- Three short proofs in graph theory
- On the span in channel assignment problems: Bounds, computing and counting
- Zero knowledge and the chromatic number
- Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
- Channel assignment on graphs of bounded treewidth
- Linear-time computability of combinatorial problems on series-parallel graphs
- Heuristics for the bandwidth colouring problem
- A linear 5-coloring algorithm of planar graphs
- Bandwidth consecutive multicolorings of graphs
- An evolutionary approach for bandwidth multicoloring problems
- Two genetic algorithms for the bandwidth multicoloring problem
- Approximation Algorithms for Bandwidth Consecutive Multicolorings
Cited In (1)
This page was built for publication: Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897950)
