Presentation 2021-12-10
相互依存ネットワークにおける最脆弱ノードの特定
Kyozo Hida, Tatsuhiro Tsuchiya,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper addresses the problem of finding the set of the most vulnerable nodes in interdependent networks where initial attacks to a few nodes can lead to a system-wide failure. An approach to the problem is proposed which utilizes SAT and integer linear programming solvers.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # DC2021-58
Date of Issue 2021-12-03 (DC)

Conference Information
Committee DC
Conference Date 2021/12/10(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair Hiroshi Takahashi(Ehime Univ.)
Vice Chair Tatsuhiro Tsuchiya(Osaka Univ.)
Secretary Tatsuhiro Tsuchiya(Nihon Univ.)
Assistant

Paper Information
Registration To Technical Committee on Dependable Computing
Language JPN-ONLY
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English)
Sub Title (in English)
Keyword(1)
Keyword(2)
Keyword(3)
Keyword(4)
Keyword(5)
1st Author's Name Kyozo Hida
1st Author's Affiliation Osaka University(Osaka Univ)
2nd Author's Name Tatsuhiro Tsuchiya
2nd Author's Affiliation Osaka University(Osaka Univ)
Date 2021-12-10
Paper # DC2021-58
Volume (vol) vol.121
Number (no) DC-293
Page pp.pp.19-23(DC),
#Pages 5
Date of Issue 2021-12-03 (DC)