• Aucun résultat trouvé

[PDF] Top 20 A Connected Version of the Graph Coloring Game

Has 10000 "A Connected Version of the Graph Coloring Game" found on our website. Below are the top 20 most common "A Connected Version of the Graph Coloring Game".

A Connected Version of the Graph Coloring Game

A Connected Version of the Graph Coloring Game

... every graph G, χ(G) ≤ χ g (G) ≤ col g (G) ≤ ∆(G) + ...study a new version of the graph coloring game ...(resp. of the graph marking ... Voir le document complet

10

Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem

Cases where finding the minimum entropy coloring of a characteristic graph is a polynomial time problem

... consider the problem of finding the minimum entropy coloring of a characteristic graph under some conditions which allow it to be in polynomial ...in the functional ... Voir le document complet

6

A probabilistic version of the game of Zombies and Survivors on graphs

A probabilistic version of the game of Zombies and Survivors on graphs

... For a given connected graph G and given k ∈ N, we consider the following probabilistic variant of Cops and Robbers, which is played over a series of discrete ...In ... Voir le document complet

21

A New Game Invariant of Graphs: the Game Distinguishing Number

A New Game Invariant of Graphs: the Game Distinguishing Number

... Algeria The distinguishing number of a graph G is a symmetry related graph invariant whose study started two decades ...ago. The distinguishing number D(G) is the ... Voir le document complet

16

The Price of Optimum in a Matching Game

The Price of Optimum in a Matching Game

... edge of this path are respectively (a, a ′ ) and (b, b ′ ), can be done in O(n 2 ...and a sketch of proof can be found in [15] (Lemma ...whether a long diminishing configuration ... Voir le document complet

12

Ramsey-type graph coloring and diagonal non-computability

Ramsey-type graph coloring and diagonal non-computability

... characterized the second-order parts S of ω-structures as those forming a Turing ideal, that is, a set of reals closed by Turing join and downward-closed by Turing ...Separation ... Voir le document complet

19

Distributed computing with advice: information sensitivity of graph coloring

Distributed computing with advice: information sensitivity of graph coloring

... and a 3-coloring algorithm A using O and working in t(n) rounds, then there exists an oracle O ′ informing at most q + 2 nodes in any n-node oriented cycle, and a 3-coloring algorithm ... Voir le document complet

24

Probabilistic graph-coloring in bipartite and split graphs

Probabilistic graph-coloring in bipartite and split graphs

... on the whole I, but rather on a (unknown a priori) sub-instance I ′ ⊂ ...in the data-set describing I has a probability p i , indicating how d i is likely to be present in the ... Voir le document complet

34

Some Problems in Graph Coloring: Methods, Extensions and Results

Some Problems in Graph Coloring: Methods, Extensions and Results

... algorithmic version of the Lovász Local Lemma in quite general ...used a new species of monotonicity argument dubbed the entropy compression ...adapted the technique for ... Voir le document complet

8

Register allocation by graph coloring under full live-range splitting

Register allocation by graph coloring under full live-range splitting

... to the largest graphs of the OCC. Be- cause of extreme live-range splitting (that was required for opti- mal spilling), optimal solutions for coalescing cannot be efficiently computed on these ... Voir le document complet

11

Fast Beeping Protocols for Deterministic MIS and ($∆ + 1$)-Coloring in Sparse Graphs (Extended Version)

Fast Beeping Protocols for Deterministic MIS and ($∆ + 1$)-Coloring in Sparse Graphs (Extended Version)

... introduce a competition protocol (RulingSet - Protocol 1 in Sect. II-B) computing a (2, 2 log N )-ruling ...as a variant of the ruling set algorithm from ...with the beeping ... Voir le document complet

15

Variations on Memetic Algorithms for Graph Coloring Problems

Variations on Memetic Algorithms for Graph Coloring Problems

... for graph coloring and HEA Memetic Algorithms [25] (MA) are hybrid metaheuristics using a local search algorithm inside a population-based ...individuals of the population are ... Voir le document complet

22

Constraint and Satisfiability Reasoning for Graph Coloring

Constraint and Satisfiability Reasoning for Graph Coloring

... caveat of Dsatur-based branch and bound algorithms, however, is that the standard lower bound, which is the size of a maximal (not necessarily maximum) clique, is computed only once at ... Voir le document complet

34

Selective Graph Coloring in Some Special Classes of Graphs

Selective Graph Coloring in Some Special Classes of Graphs

... as graph coloring problems (see [2, 8, 12, 15, 18, ...to the classical vertex coloring problem in undirected graphs; if in addition precedence con- straints occur, the problem may be ... Voir le document complet

12

On the most imbalanced orientation of a graph

On the most imbalanced orientation of a graph

... introduce a variant of the satis- fiability problem that we will reduce to a M AX I M instance: the not-all-equal at most ...is a restriction of not-all-equal at most ... Voir le document complet

15

A formula for the value of a stochastic game

A formula for the value of a stochastic game

... Whether the value of a finite stochastic game can be computed in polynomial time is a famous open problem in computer ...because the class of simple stochastic games is ... Voir le document complet

19

Joseph B. Kruskal, Jr., 1956, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Version bilingue et commentée

Joseph B. Kruskal, Jr., 1956, On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Version bilingue et commentée

... (US Oce of Naval Research) pour ses recherches (voir sa biographie sur web.archives ). Après quelques années à l'université, il travaille à partir de 1959 pour les laboratoires Bell, tout en continuant à publier ... Voir le document complet

10

On the most imbalanced orientation of a graph

On the most imbalanced orientation of a graph

... study the problem of orienting the edges of a graph such that the minimum over all the vertices of the absolute difference between the ... Voir le document complet

33

On the Grundy number of a graph

On the Grundy number of a graph

... extension of c as considered in the last paragraph. If a colour class S i of type 2 has not been extended, it may still be ...after the second step in which we add some candidate to ... Voir le document complet

11

Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring

Closed quasigeodesics, escaping from polygons, and conflict-free graph coloring

... Four colors are sometimes necessary and always sufficient for conflict-free coloring with open neighborhoods of planar bipartite graphs.. Eight colors always suffice [r] ... Voir le document complet

58

Show all 10000 documents...