磁盘图的在线着色

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-10-18 DOI:10.1016/j.tcs.2024.114924

Joanna Chybowska-Sokół , Konstanty Junosza-Szaniawski

{"title":"磁盘图的在线着色","authors":"Joanna Chybowska-Sokół , Konstanty Junosza-Szaniawski","doi":"10.1016/j.tcs.2024.114924","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we give a family of online algorithms for the classical coloring problem of intersection graphs of disks with bounded diameter. Our algorithms make use of a geometric representation of such graphs and are inspired by an algorithm of Fiala et al., but have better competitive ratios. The improvement comes from using two techniques of partitioning the set of vertices before coloring them. One of them is an application of a <em>b</em>-fold coloring of the plane. The method is more general and we show how it can be applied to coloring other shapes on the plane as well as adjust it for online <span><math><mi>L</mi><mo>(</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-labeling.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1020 ","pages":"Article 114924"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Online coloring of disk graphs\",\"authors\":\"Joanna Chybowska-Sokół , Konstanty Junosza-Szaniawski\",\"doi\":\"10.1016/j.tcs.2024.114924\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>In this paper, we give a family of online algorithms for the classical coloring problem of intersection graphs of disks with bounded diameter. Our algorithms make use of a geometric representation of such graphs and are inspired by an algorithm of Fiala et al., but have better competitive ratios. The improvement comes from using two techniques of partitioning the set of vertices before coloring them. One of them is an application of a <em>b</em>-fold coloring of the plane. The method is more general and we show how it can be applied to coloring other shapes on the plane as well as adjust it for online <span><math><mi>L</mi><mo>(</mo><mn>2</mn><mo>,</mo><mn>1</mn><mo>)</mo></math></span>-labeling.</div></div>\",\"PeriodicalId\":49438,\"journal\":{\"name\":\"Theoretical Computer Science\",\"volume\":\"1020 \",\"pages\":\"Article 114924\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2024-10-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Theoretical Computer Science\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0304397524005413\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005413","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

本文针对直径有界的磁盘交集图的经典着色问题给出了一系列在线算法。我们的算法利用了此类图的几何表示法，并受到 Fiala 等人算法的启发，但具有更好的竞争比率。这种改进来自于在着色前使用了两种分割顶点集的技术。其中一种是平面 b 折叠着色的应用。这种方法更具通用性，我们展示了如何将其应用于平面上其他形状的着色，以及如何将其调整为在线 L(2,1)- 标记。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Online coloring of disk graphs

In this paper, we give a family of online algorithms for the classical coloring problem of intersection graphs of disks with bounded diameter. Our algorithms make use of a geometric representation of such graphs and are inspired by an algorithm of Fiala et al., but have better competitive ratios. The improvement comes from using two techniques of partitioning the set of vertices before coloring them. One of them is an application of a b-fold coloring of the plane. The method is more general and we show how it can be applied to coloring other shapes on the plane as well as adjust it for online

L (2, 1)

-labeling.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.