95 search results - page 6 / 19 » Hamiltonian-Laceability of Star Graphs |
108
click to vote
EJC
2006
15 years 1 months ago
2006
The small subgraph conditioning method first appeared when Robinson and the second author showed the almost sure hamiltonicity of random d-regular graphs. Since then it has been u...
110
click to vote
ISPAN
2002
IEEE
15 years 6 months ago
2002
IEEE
The concept of safety vector can guide efficient fault-tolerant routing on interconnection networks. The safety vector on the hypercube is based on the distance of a pair of nodes...
151
click to vote
CORR
2011
Springer
14 years 5 months ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
GG
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Adaptive star grammars generalize well-known graph grammar formalisms based on hyperedge and node replacement while retaining, e.g., parseability and the commutativity an...
160
click to vote
ECCV
2008
Springer
16 years 3 months ago
2008
Springer
In recent years, segmentation with graph cuts is increasingly used for a variety of applications, such as photo/video editing, medical image processing, etc. One of the most common...