A tight bound for online colouring of disk graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A tight bound for online colouring of disk graphs

Published:2007-10 Issue:2-3 Volume:384 Page:152-160
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Caragiannis Ioannis,Fishkin Aleksei V.,Kaklamanis Christos,Papaioannou Evi

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference18 articles.

1. Online Computation and Competitive Analysis;Borodin,1998

2. Online algorithms for disk graphs;Caragiannis,2004

3. Unit disk graphs;Clark;Discrete Mathematics,1990

4. Introduction to Algorithms;Cormen,2001

5. On-line coloring of geometric intersection graphs;Erlebach;Computational Geometry: Theory and Applications,2002

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Online Coloring of Disk Graphs;2023

2. Limitations of current wireless link scheduling algorithms;Theoretical Computer Science;2020-11

3. Tight Bounds for Online Coloring of Basic Graph Classes;Algorithmica;2020-08-25

4. Effective and efficient dynamic graph coloring;Proceedings of the VLDB Endowment;2017-11

5. Limitations of Current Wireless Scheduling Algorithms;Algorithms for Sensor Systems;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP