Bandwidth consecutive multicolorings of graphs

DOI10.1016/J.TCS.2013.02.015MaRDI QIDQ2445874zbMATH OpenOpenAlexFDO

Authors Kazuhide Nishikawa, Takao Nishizeki, Xiao Zhou

Publication date 15 April 2014

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2013.02.015

zbMATH Keywords

algorithmapproximationFPTASchannel assignmentseries-parallel graphacyclic orientationpartial \(k\)-treemulticoloringbandwidth coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract)
• Approximation algorithms for bandwidth consecutive multicolorings (extended abstract)
• Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
• scientific article; zbMATH DE number 2089998
• Multicolorings of series-parallel graphs

Cites work

• scientific article; zbMATH DE number 1361465 (Why is no real title available?)
• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract)
• An evolutionary approach for bandwidth multicoloring problems
• Channel assignment on graphs of bounded treewidth
• Generalized coloring for tree-like graphs
• Linear degree extractors and the inapproximability of max clique and chromatic number
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• Linear-time computability of combinatorial problems on series-parallel graphs
• Multicoloring trees.
• Multicolorings of series-parallel graphs
• Scheduling
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees

Cited in

(5)

• Generalized edge-colorings of weighted graphs
• Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs
• On a reduction of the interval coloring problem to a series of bandwidth coloring problems
• Algorithms for bandwidth consecutive multicolorings of graphs (extended abstract)
• Approximation algorithms for bandwidth consecutive multicolorings (extended abstract)

This page was built for publication: Bandwidth consecutive multicolorings of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2445874)