Information Processing Letters

Paper

21 Dec 1992

The greedy algorithm is optimal for on-line edge coloring

View publication

Abstract

No abstract available.

Related

Conference paper

Biologically-inspired training of spiking recurrent neural networks with neuromorphic hardware

Workshop paper

PaccMannRL on SARS-CoV-2: Designing antiviral candidates with conditional generative models

Conference paper

Scalable Fine-Grained Parallel Cycle Enumeration Algorithms

Conference paper

JITServer: Disaggregated Caching JIT Compiler for the JVM in the Cloud

View all publications