95 search results - page 5 / 19 » Hamiltonian-Laceability of Star Graphs |
147
Voted
CIS
2010
Springer
14 years 4 months ago
2010
Springer
A group of mobile robots can localize cooperatively, using relative position and absolute orientation measurements, fused through an extended Kalman filter (ekf). The topology of ...
JDCTA
2010
14 years 4 months ago
2010
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
A fundamental problem related to RDF query processing is selectivity estimation, which is crucial to query optimization for determining a join order of RDF triple patterns. In thi...
IPPS
1998
IEEE
15 years 1 months ago
1998
IEEE
Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we p...
65
Voted
DAM
2008
14 years 9 months ago
2008
Given graphs G, G1, . . . , Gk, where k 2, the notation G (G1, G2, . . . , Gk) denotes that every factorization F1 F2