Algorithms 2014, 7(2), 243-252; doi:10.3390/a7020243

Efficient Algorithms for Subgraph Listing

1,* email and 2email
Received: 6 March 2014; in revised form: 4 May 2014 / Accepted: 7 May 2014 / Published: 15 May 2014
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Abstract: 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.
Keywords: subgraph; subgraph isomorphism; subgraph listing; clique; triangle; output-sensitive algorithm; time complexity
PDF Full-text Download PDF Full-Text [198 KB, uploaded 15 May 2014 09:45 CEST]

Export to BibTeX |

MDPI and ACS Style

Zechner, N.; Lingas, A. Efficient Algorithms for Subgraph Listing. Algorithms 2014, 7, 243-252.

AMA Style

Zechner N, Lingas A. Efficient Algorithms for Subgraph Listing. Algorithms. 2014; 7(2):243-252.

Chicago/Turabian Style

Zechner, Niklas; Lingas, Andrzej. 2014. "Efficient Algorithms for Subgraph Listing." Algorithms 7, no. 2: 243-252.

Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert