Presentation 2007-12-19
A Consideration on Hitting Set Problem and Incidence Matrix
Kunikatsu KOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We examine a solution of hitting set problem. By using incidence matrix M of graph G, we can decide whether hitting set problem has a solution or not efficiently.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) hitting set problem / NP complete / incidence matrix / NP=P
Paper # ISEC2007-120
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/12/12(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 Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Consideration on Hitting Set Problem and Incidence Matrix
Sub Title (in English)
Keyword(1) hitting set problem
Keyword(2) NP complete
Keyword(3) incidence matrix
Keyword(4) NP=P
1st Author's Name Kunikatsu KOBAYASHI
1st Author's Affiliation Faculty of Engineering, Yamagata University()
Date 2007-12-19
Paper # ISEC2007-120
Volume (vol) vol.107
Number (no) 397
Page pp.pp.-
#Pages 4
Date of Issue