1302 search results - page 46 / 261 » On the Strong Chromatic Number |
186
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Graph pattern matching is often defined in terms of subgraph isomorphism, an np-complete problem. To lower its complexity, various extensions of graph simulation have been consid...
157
click to vote
CSC
2006
15 years 7 months ago
2006
This paper reports that in parallel Monte-Carlo simulations of the 2D Ising-Model, commonly used pseudo-random number generators (PRNG) lead to manifestly erroneous results. When ...
158
click to vote
IWANN
2005
Springer
15 years 11 months ago
2005
Springer
A proper gait assessment in patients with knee or hip injuries strongly determines the diagnosis and consequently the evolution of the pathology, the quality of life of implanted p...
180
click to vote
KDID
2004
15 years 7 months ago
2004
We are designing new data mining techniques on boolean contexts to identify a priori interesting bi-sets (i.e., sets of objects or transactions associated to sets of attributes or ...
162
click to vote
SODA
2004
ACM
15 years 7 months ago
2004
ACM
We study vertex colorings of the square G2 of an outerplanar graph G. We find the optimal bound of the inductiveness, chromatic number and the clique number of G2 as a function of...