Presentation 2003/2/14
A minimum feedback node set in a trivalent Cayley graph
Yasuto SUZUKI, Keiichi KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A minimum feedback node set in a graph is a minimum node subset whose deletion makes the graph acyclic. Its detection in a dependency graph is important to recover from a deadlock configuration. A livelock configuration is also detectable if a check point is set in each node in the minimum feedback node set. Hence, its detection is very important to establish dependable network systems. In this letter, we give minimum feedback node sets in trivalent Cayley graphs. For any node, we can judge if it is included in the set or not in constant time.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) minimum feedback node set / trivalent Cayley graphs / interconnection networks
Paper # DC2002-89
Date of Issue

Conference Information
Committee DC
Conference Date 2003/2/14(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 Dependable Computing (DC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A minimum feedback node set in a trivalent Cayley graph
Sub Title (in English)
Keyword(1) minimum feedback node set
Keyword(2) trivalent Cayley graphs
Keyword(3) interconnection networks
1st Author's Name Yasuto SUZUKI
1st Author's Affiliation Faculty of Technology, Tokyo University of Agriculture and Technology()
2nd Author's Name Keiichi KANEKO
2nd Author's Affiliation Faculty of Technology,T okyo University of Agriculture and Technology
Date 2003/2/14
Paper # DC2002-89
Volume (vol) vol.102
Number (no) 658
Page pp.pp.-
#Pages 5
Date of Issue