3204 search results - page 175 / 641 » The b-chromatic Number of a Graph |
144
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...
124
click to vote
EOR
2010
15 years 5 months ago
2010
Given an undirected graph G = (V, E) with a set V of vertices and a set E of edges, the graph coloring problem consists of partitioning all vertices into k independent sets and th...
175
click to vote
JCO
2008
15 years 5 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
167
Voted
JDA
2006
15 years 5 months ago
2006
Abstract. Sreedhar et al. [SGL98, Sre95] have presented an eliminationbased algorithm to solve data flow problems. A thorough analysis of the algorithm shows that the worst-case pe...
132
click to vote
GC
2007
Springer
15 years 5 months ago
2007
Springer
Let Γ be a finite digraph and let G be a subgroup of the automorphism group of Γ. A directed cycle C of Γ is called G-consistent whenever there is an element of G whose restri...