3204 search results - page 45 / 641 » The b-chromatic Number of a Graph |
OPODIS
2008
13 years 11 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
JCT
2011
13 years 4 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...
CORR
2007
Springer
13 years 10 months ago
2007
Springer
—For a linear block code C, its stopping redundancy is defined as the smallest number of check nodes in a Tanner graph for C, such that there exist no stopping sets of size smal...
AAAI
2010
13 years 11 months ago
2010
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
VALUETOOLS
2006
ACM
14 years 3 months ago
2006
ACM
We present the software tool “Web Graph Analyzer”. This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose ver...