458 search results - page 39 / 92 » Totally magic graphs |
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
A Steiner star for a set P of n points in Rd connects an arbitrary point in Rd to all points of P, while a star connects one of the points in P to the remaining n - 1 points of P....
WWW
2011
ACM
13 years 2 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
SIGMETRICS
2003
ACM
14 years 29 days ago
2003
ACM
It has been observed that the degrees of the topologies of several communication networks follow heavy tailed statistics. What is the impact of such heavy tailed statistics on the...