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...
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Artigo |
| Lingua: | Inglês |
| Pubblicazione: |
MDPI AG
2014-05-01
|
| Serie: | Algorithms |
| Soggetti: | |
| Accesso online: | http://www.mdpi.com/1999-4893/7/2/243 |
| Tags: |
Nessun Tag, puoi essere il primo ad aggiungerne!!
|