296 search results - page 43 / 60 » Group connectivity of certain graphs |
STACS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
DM
2006
13 years 7 months ago
2006
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
SIGCOMM
2009
ACM
14 years 2 months ago
2009
ACM
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
ADCM
1998
13 years 7 months ago
1998
: Linear integral operators describing physical problems on symmetric domains often are equivariant, which means that they commute with certain symmetries, i.e., with a group of or...
IDEAL
2007
Springer
14 years 1 months ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...