Efficient Algorithms for Subgraph Listing
AbstractSubgraph 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
Scifeed alert for new publicationsNever 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
Zechner, N.; Lingas, A. Efficient Algorithms for Subgraph Listing. Algorithms 2014, 7, 243-252.
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.