Sciweavers

618 search results - page 7 / 124
» Short cycle connectivity
Sort
View
MICS
2010
57views more  MICS 2010»
13 years 2 months ago
On the Pagenumber of the Cube-Connected Cycles
Yuuki Tanaka, Yukio Shibata
COMPSAC
2001
IEEE
13 years 11 months ago
Designing Process: Taming the Web Development Cycle
In this short paper, we present the outline of a process for developing design products. The advantage of having a process for these types of projects is that it allows us to focu...
Adam Steele, Roymieco Carter
TJS
2010
89views more  TJS 2010»
13 years 5 months ago
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers
The high-performance supercomputers will consist of several millions of CPUs in the next decade. The interconnection networks in such supercomputers play an important role for achi...
Yamin Li, Shietung Peng, Wanming Chu
COMBINATORICS
2004
82views more  COMBINATORICS 2004»
13 years 7 months ago
Decomposing Infinite 2-Connected Graphs into 3-Connected Components
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...
R. Bruce Richter
DM
2008
95views more  DM 2008»
13 years 7 months ago
Forbidden subgraphs and the existence of paths and cycles passing through specified vertices
In [2], Duffus et al. showed that every connected graph G which contains no induced subgraph isomorphic to a claw or a net is traceable. And they also showed that if a 2-connected...
Jun Fujisawa, Katsuhiro Ota, Takeshi Sugiyama, Mas...