Detecting Non-subgraphs Efficiently by Comparing Eigenvalues of Decomposed Graphs

スポンサーリンク

概要

• 論文の詳細を見る

• The problem of deciding whether a graph contains another graph appears in various applications. For solving this problem efficiently, we developed a numerical method to detect non-subgraphs, graphs which are not subgraphs of other graphs, by comparing eigenvalues of graphs. In this paper, we propose a method to make the detection more efficient by comparing of eigenvalues of graphs decomposed according to labels of the vertices and the edges. The new approach not only reduces the cost of computing eigenvalues but also increases the possibility of detecting non-subgraphs. The experimental evaluation shows the effectiveness of the proposed method.

• The Institute of Electronics, Information and Communication Engineersの論文

著者

• Katayama Kaoru

  Graduate School Of Engineering Tokyo Metropolitan University

• NAGAYA Hideki

  Graduate School of System Design, Tokyo Metropolitan University

• AMAGASA Yosuke

  Graduate School of System Design, Tokyo Metropolitan University

• KATAYAMA Kaoru

  Graduate School of System Design, Tokyo Metropolitan University

関連論文

• An Interactive Annotation Framework for Image Retrieval (夏のデータベースワークショップDBWS2004)
• An Interactive Annotation Framework for Image Retrieval (夏のデータベースワークショップ(DBWS2004))
• Galois' Lattices as a Classification Technique for Image Retrieval
• Galois' Lattices as a Classification Technique for Image Retrieval
• Detecting Non-subgraphs Efficiently by Comparing Eigenvalues of Decomposed Graphs
• Galois' Lattices as a Classification Technique for Image Retrieval

スポンサーリンク