K-Connected Cores Computation in Large Dual Networks
Abstract Computing $$k\text {-}core$$ k-core s is a fundamental and important graph problem, which can be applied in many areas, such as community detection, network visualization, and network topology analysis. Due to the complex relationship between different entities, dual graph widely exists in...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-11-01
|
| Series: | Data Science and Engineering |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1007/s41019-018-0078-0 |