Efficient Algorithms for Subgraph Listing

Algorithms

Andrzej Lingas¹  Niklas Zechner² 

[1] Department of Computer Science, Lund University, 221 00 Lund, Sweden;Department of Computing Science, Umea University, 901 87 Umea, Sweden;

关键词: subgraph;    subgraph isomorphism;    subgraph listing;    clique;    triangle;    output-sensitive algorithm;    time complexity;   

DOI  :  10.3390/a7020243

来源: DOAJ

【 摘 要 】

Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and show that it cannot be extended to general subgraphs of fixed size. Then, we consider the algorithm due to Ga̧sieniec et al. for finding multiple witnesses of a Boolean matrix product, and use it to design a new output-sensitive algorithm for listing all triangles in a graph. As a corollary, we obtain an output-sensitive algorithm for listing subgraphs and induced subgraphs isomorphic to an arbitrary fixed pattern graph.

【 授权许可】

Unknown