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

Export Article

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

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.
Received: 6 March 2014 / Revised: 4 May 2014 / Accepted: 7 May 2014 / Published: 15 May 2014
View Full-Text   |   Download PDF [198 KB, uploaded 15 May 2014]

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. 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
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

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

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top