# Distributed Minimum Vertex Coloring and Maximum Independent Set in Chordal Graphs

MFCS, Volume abs/1805.04544, 2019.

EI

Abstract:

We give deterministic distributed $(1+epsilon)$-approximation algorithms for Minimum Vertex Coloring and Maximum Independent Set on chordal graphs in the LOCAL model. Our coloring algorithm runs in $O(frac{1}{epsilon} log n)$ rounds, and our independent set algorithm has a runtime of $O(frac{1}{epsilon}log(frac{1}{epsilon})log^* n)$ round...More

Code:

Data:

Get fulltext within 24h

Other Links

Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.

?

￥

Upload a single paper

for 5 coins

Wechat's Red Packet

?

￥

Upload 50 articles

for 280 coins

Wechat's Red Packet

?

￥

Upload 200 articles

for 1200 coins

Wechat's Red Packet

?

￥

Upload 500 articles

for 3000 coins

Wechat's Red Packet

?

￥

Upload 1000 articles

for 7000 coins

Wechat's Red Packet

Tags

Comments