Multicoloring trees.
From MaRDI portal
Publication:1401922
DOI10.1016/S0890-5401(02)00032-9zbMath1054.68016MaRDI QIDQ1401922
Andrzej Proskurowski, Magnús M. Halldórsson, Guy Kortsarz, Jan Arne Telle, Hadas Shachnai, Ravit Salman
Publication date: 19 August 2003
Published in: Information and Computation (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Upper bounds for static resource allocation in a distributed system
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
- Zero knowledge and the chromatic number
- Preemptive versus nonpreemptive scheduling for biprocessor tasks on dedicated processors
- On chromatic sums and distributed resource allocation
- The chromatic sum of a graph: history and recent developments
- Minimum Color Sum of Bipartite Graphs
- Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\cal NP$-Complete
- Sum Multicoloring of Graphs
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees