Presentation 2002/10/17
Semi Hyper-rings and Enriched Semi Hyper-rings
ALTMAN Tom, Yoshihide IGARASHI, Kazuhiro MOTEGI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A graph G = (V,E) is called a semi hyper-ring with P nodes (P-SHR for short) if V = {κ, κ + 1,...,P + κ - 1} for some fixed κ and E = {{u,υ}| the positional distance between nodes u and υ is a power of 2}. An enriched P-SHR is a graph constructed from P-SHR by allowing additional connections between all pairs of nodes that are κ positional distance away each other, for a fixed κ, 3≦κ< P, which is a not power of 2. We show that the connectivity of a P-SHR (an enriched P-SHR) is equal to its degree, say δ, by the explicit construction of δ node-disjoint paths connecting nodes s and t.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Connectivity / hyper-ring / network / node disjoint path / semi hyper-ring
Paper # COMP2002-40
Date of Issue

Conference Information
Committee COMP
Conference Date 2002/10/17(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Semi Hyper-rings and Enriched Semi Hyper-rings
Sub Title (in English)
Keyword(1) Connectivity
Keyword(2) hyper-ring
Keyword(3) network
Keyword(4) node disjoint path
Keyword(5) semi hyper-ring
1st Author's Name ALTMAN Tom
1st Author's Affiliation Department of Computer Science, University of Colorado()
2nd Author's Name Yoshihide IGARASHI
2nd Author's Affiliation Department ot Computer science, Gunma University
3rd Author's Name Kazuhiro MOTEGI
3rd Author's Affiliation Department ot Computer science, Gunma University
Date 2002/10/17
Paper # COMP2002-40
Volume (vol) vol.102
Number (no) 396
Page pp.pp.-
#Pages 6
Date of Issue