Results 61 to 70 of about 1,883 (72)
The analysis of find and versions of it [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Analysis of ...
Diether Knof, Uwe Roesler
doaj +1 more source
The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Analysis of ...
Guy Louchard, Helmut Prodinger
doaj +1 more source
On neighbour-distinguishing colourings from lists [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 Graphs and ...
Mirko Horňák, Mariusz WoźniaK
doaj +1 more source
Combinatorial Calabi flows on surfaces [PDF]
, 2013 For triangulated surfaces, we introduce the combinatorial Calabi flow which is an analogue of smooth Calabi flow. We prove that the solution of combinatorial Calabi flow exists for all time.
Ge, Huabin
core
1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Graph ...
Rafal Witkowski, Janez Žerovnik
doaj +1 more source
Surjective cellular automata far from the Garden of Eden [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and ...
Silvio Capobianco +2 more
doaj +1 more source
Two player game variant of the Erd\H os-Szekeres problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Parikshit Kolipaka, Sathish Govindarajan
doaj +1 more source
The Cerný conjecture for automata respecting intervals of a directed graph [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Automata, Logic and ...
Mariusz Grech, Andrzej Kisielewicz
doaj +1 more source
On the Core of a Unicyclic Graph
, 2011 A set S is independent in a graph G if no two vertices from S are adjacent. By core(G) we mean the intersection of all maximum independent sets. The independence number alpha(G) is the cardinality of a maximum independent set, while mu(G) is the size of ...
Levit, Vadim E., Mandrescu, Eugen
core +1 more source
Choosability of a weighted path and free-choosability of a cycle [PDF]
, 2011 A graph $G$ with a list of colors $L(v)$ and weight $w(v)$ for each vertex $v$ is $(L,w)$-colorable if one can choose a subset of $w(v)$ colors from $L(v)$ for each vertex $v$, such that adjacent vertices receive disjoint color sets.
Aubry, Yves +2 more
core +2 more sources