2021
DOI: 10.1145/3433652
|View full text |Cite
|
Sign up to set email alerts
|

A Survey on Subgraph Counting

Abstract: Computing subgraph frequencies is a fundamental task that lies at the core of several network analysis methodologies, such as network motifs and graphlet-based metrics, which have been widely used to categorize and compare networks from multiple domains. Counting subgraphs is, however, computationally very expensive, and there has been a large body of work on efficient algorithms and strategies to make subgraph counting feasible for larger subgraphs and networks. This survey aims precisely to provide… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
15
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 64 publications
(18 citation statements)
references
References 159 publications
0
15
0
Order By: Relevance
“…For example, a 6-node induced subgraph leads up to 112 different types of subgraphs and 407 different orbits. Taking link directions into consideration, there are 1, 530, 843 subgraphs and 9, 031, 113 orbits [35].…”
Section: B Motifs Vs Graphletsmentioning
confidence: 99%
“…For example, a 6-node induced subgraph leads up to 112 different types of subgraphs and 407 different orbits. Taking link directions into consideration, there are 1, 530, 843 subgraphs and 9, 031, 113 orbits [35].…”
Section: B Motifs Vs Graphletsmentioning
confidence: 99%
“…To identify higher-order patterns, the spatial relatedness of objects can also be modeled as a network. Ribeiro et al summarize the field of sub-graph counting and motif discovery [71]. However, the number of cells (nodes in the graph) in combination with a variety of cell types (node attributes) renders current motif discovery algorithms computationally infeasible for interactive setups, especially when considering interaction at multiple scales.…”
Section: Related Workmentioning
confidence: 99%
“…Graphlets is a similar, but slightly different method compared to our technique. Graplets are small ( n < 5) subgraphs of a larger graph through which the structure of larger graphs can be characterized [RPS∗21]. They have been used to gauge structural similarity in egocentric networks for visualization [HACH12].…”
Section: Background and Related Workmentioning
confidence: 99%