1952 search results - page 111 / 391 » Complete partitions of graphs |
152
click to vote
ICNP
2000
IEEE
15 years 8 months ago
2000
IEEE
Multicast sessions may have a large number of receivers with heterogeneous reception capacities. To accommodate this heterogeneity, various multi-rate schemes, based upon the use ...
246
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
Existing techniques for autonomous indoor navigation are often environment-specific and thus limited in terms of their applicability. In this paper, we take a fundamentally differ...
105
click to vote
CADE
2006
Springer
16 years 4 months ago
2006
Springer
We present a verified enumeration of tame graphs as defined in Hales' proof of the Kepler Conjecture and confirm the completeness of Hales' list of all tame graphs while ...
142
click to vote
COCO
2006
Springer
15 years 8 months ago
2006
Springer
We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, o...
127
click to vote
EJC
2006
15 years 4 months ago
2006
A general method for finding elementary abelian regular covering projections of finite connected graphs is applied to the Petersen graph. As a result, a complete list of pairwise ...