Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:3191564
Jump to:navigation, search

DOI10.4086/TOC.2012.V008A025zbMath1301.05325OpenAlexW2296003088MaRDI QIDQ3191564

Aranyak Mehta, Bahman Bahmani

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2012.v008a025

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

online algorithmrandom ordergraph edge coloring


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Online algorithms; streaming algorithms (68W27)


Related Items (2)

Online Edge Coloring via Tree Recurrences and Correlation Decay ⋮ Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting)







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3191564&oldid=16366761"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 22:01.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki