Presentation 2007-11-22
A Consideration on Clique Problem and Adjacency Matrix
Kunikatsu KOBAYASHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We examine a solution of k-clique problem. By using adjacency matrix of graph G, we can decide whether k-clique of graph G is existing or not efficiently.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) clique problem / NP complete / adjacency matrix / NP=P
Paper # ISEC2007-99,OIS2007-71
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/11/15(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 Clique Problem and Adjacency Matrix
Sub Title (in English)
Keyword(1) clique problem
Keyword(2) NP complete
Keyword(3) adjacency matrix
Keyword(4) NP=P
1st Author's Name Kunikatsu KOBAYASHI
1st Author's Affiliation Faculty of Engineering, Yamagata University()
Date 2007-11-22
Paper # ISEC2007-99,OIS2007-71
Volume (vol) vol.107
Number (no) 346
Page pp.pp.-
#Pages 5
Date of Issue