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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms Ročník 7; číslo 2; s. 243 - 252
Hlavní autoři: Zechner, Niklas, Lingas, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 2014
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1999-4893
1999-4893
DOI:10.3390/a7020243