Next Article in Journal
A Faster Quick Search Algorithm
Previous Article in Journal
Application of Imperialist Competitive Algorithm on Solving the Traveling Salesman Problem
Open AccessArticle

Efficient Algorithms for Subgraph Listing

1
Department of Computing Science, Umea University, 901 87 Umea, Sweden
2
Department of Computer Science, Lund University, 221 00 Lund, Sweden
*
Author to whom correspondence should be addressed.
Algorithms 2014, 7(2), 243-252; https://doi.org/10.3390/a7020243
Received: 6 March 2014 / Revised: 4 May 2014 / Accepted: 7 May 2014 / Published: 15 May 2014
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. View Full-Text
Keywords: subgraph; subgraph isomorphism; subgraph listing; clique; triangle; output-sensitive algorithm; time complexity subgraph; subgraph isomorphism; subgraph listing; clique; triangle; output-sensitive algorithm; time complexity
MDPI and ACS Style

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

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop