3204 search results - page 139 / 641 » The b-chromatic Number of a Graph |
RSA
2000
13 years 10 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
HICSS
2008
IEEE
14 years 4 months ago
2008
IEEE
In this work we apply graph theoretic tools to provide a close bound on a frontier relating the number of line outages in a grid to the power disrupted by the outages. This fronti...
SC
1995
ACM
14 years 1 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...
KDD
2005
ACM
14 years 10 months ago
2005
ACM
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
AI
2010
Springer
13 years 10 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...