Computing and Combinatorics

DOI10.1007/B99243zbMATH Open1091.68681OpenAlexW2491887524MaRDI QIDQ4681192FDOQ4681192

Authors: N. S. Narayanaswamy 

Publication date: 15 June 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b99243

Recommendations

• scientific article; zbMATH DE number 17824
• scientific article; zbMATH DE number 1003306
• Max-coloring and online coloring with bandwidths on interval graphs
• An improved algorithm for online coloring of intervals with bandwidth
• A polynomial time approximation algorithm for dynamic storage allocation

Mathematics Subject Classification ID

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

Cited In (7)

• An improved algorithm for online coloring of intervals with bandwidth
• On the Max Coloring Problem
• A polynomial time approximation algorithm for dynamic storage allocation
• Title not available (Why is that?)
• Single and multiple device DSA problems, complexities and online algorithms
• A new lower bound for the on-line coloring of intervals with bandwidth
• Variable sized online interval coloring with bandwidth

This page was built for publication: Computing and Combinatorics

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