A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks.
Jing LiangHaixing ZhaoJun YinPublished in: Theor. Comput. Sci. (2022)
Keyphrases
- computational complexity
- high accuracy
- dynamic programming
- experimental evaluation
- detection method
- computationally efficient
- preprocessing
- cost function
- similarity measure
- community detection
- social networks
- segmentation method
- model selection
- input data
- image registration
- probabilistic model
- computational cost
- prior knowledge
- pairwise
- objective function