Efficient Algorithms for Subgraph Listing

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 subg...

Full description

Bibliographic Details

Published in:	Algorithms Vol. 7; no. 2; pp. 243 - 252
Main Authors:	Zechner, Niklas, Lingas, Andrzej
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 2014
Subjects:	Algorithms Boolean algebra Clique Graph theory Graphs Isomorphism Output-sensitive algorithm Subgraph Subgraph isomorphism Subgraph listing Time complexity Triangle Triangles
ISSN:	1999-4893, 1999-4893
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!