Add to ORKGWe study the power of randomization in the design of online graph coloring algorithms. No specific network topology for which randomized online algorithms perform substantially better than deterministic algorithms is known until now. We present randomized lower bounds for online coloring of some well studied network topologies
Certain types of routing, scheduling and resource allocation problems in a distributed setting can ...
Consider the following generalized notion of graph coloring: a coloring of the vertices of a graph~...
AbstractIn the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generat...
We resolve a number of long-standing open problems in online graph coloring. More specifically, we d...
AbstractAn algorithm for vertex-coloring graphs is said to be on-line if each vertex is irrevocably ...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We study a randomized algorithm for graph domination, by which, according toa uniformly chosen permu...
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs...
Vizing's celebrated theorem asserts that any graph of maximum degree Delta admits an edge coloring u...
(i) We provide a framework for online conflict-free coloring (CF-coloring) any hypergraph. We use th...
We present lower bounds on the competitive ratio of randomized algorithms for a wide class of on-lin...
We present lower bounds on the competitive ratio of randomized algorithms for a wide class of on-lin...
Abstract. Consider the following random process: The vertices of a binomial random graph Gn,p are re...
Certain types of routing, scheduling and resource allocation problems in a distributed setting can ...
Consider the following generalized notion of graph coloring: a coloring of the vertices of a graph~...
AbstractIn the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generat...
We resolve a number of long-standing open problems in online graph coloring. More specifically, we d...
AbstractAn algorithm for vertex-coloring graphs is said to be on-line if each vertex is irrevocably ...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We generalize the model of online computation with three players (algorithm, adversary and an oracle...
We study a randomized algorithm for graph domination, by which, according toa uniformly chosen permu...
This paper considers the problem of online graph colouring. An algorithm for vertex-colouring graphs...
Vizing's celebrated theorem asserts that any graph of maximum degree Delta admits an edge coloring u...
(i) We provide a framework for online conflict-free coloring (CF-coloring) any hypergraph. We use th...
We present lower bounds on the competitive ratio of randomized algorithms for a wide class of on-lin...
We present lower bounds on the competitive ratio of randomized algorithms for a wide class of on-lin...
Abstract. Consider the following random process: The vertices of a binomial random graph Gn,p are re...
Certain types of routing, scheduling and resource allocation problems in a distributed setting can ...
Consider the following generalized notion of graph coloring: a coloring of the vertices of a graph~...
AbstractIn the online F-avoidance edge-coloring game with r colors, a graph on n vertices is generat...