Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time - MaRDI portal

Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

From MaRDI portal

Publication:5390012

Jump to:navigation, search

DOI10.4230/LIPIcs.STACS.2009.1852zbMath1236.68195OpenAlexW1827871937MaRDI QIDQ5390012

Fabian Kuhn

Publication date: 24 April 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_4b57.html

zbMATH Keywords

graph coloring distributed algorithms wireless networks multicoloring local algorithms TDMA medium access control

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Distributed systems (68M14)

Related Items (4)

Can we locally compute sparse connected subgraphs? ⋮ Tight Lower Bounds for the Complexity of Multicoloring ⋮ Improved distributed algorithms for coloring interval graphs with application to multicoloring trees ⋮ Unnamed Item

This page was built for publication: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5390012&oldid=20114981"