Pages that link to "Item:Q3460706"
From MaRDI portal
The following pages link to Exact Bounds for Distributed Graph Colouring (Q3460706):
Displaying 11 items.
- Vertex coloring with communication and local memory constraints in synchronous broadcast networks (Q1629936) (← links)
- Polynomial lower bound for distributed graph coloring in a weak LOCAL model (Q1660925) (← links)
- Large cuts with local algorithms on triangle-free graphs (Q2411507) (← links)
- Distributed minimum vertex coloring and maximum independent set in chordal graphs (Q2672608) (← links)
- Distributed Graph Coloring: Fundamentals and Recent Developments (Q4980035) (← links)
- Mathematical modeling of positive connection functioning in the tumor markers p53-microRNA system (Q5043027) (← links)
- Deterministic distributed vertex coloring in polylogarithmic time (Q5176216) (← links)
- Distributed Coloring in Sparse Graphs with Fewer Colors (Q5197707) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5892122) (← links)
- Distributed algorithms for the Lovász local lemma and graph coloring (Q5920074) (← links)
- Distributed computing in the asynchronous LOCAL model (Q6652468) (← links)
