Approach to reduce the communication cost when partitioning a big graph.
Harif AsmaaNamir AbdelwahidMarzak AbdelazizPublished in: ANT/EDI40 (2023)
Keyphrases
- communication cost
- sensor networks
- bandwidth consumption
- partitioning algorithm
- graph partitioning
- distributed data
- low overhead
- communication overhead
- network size
- data distribution
- low bandwidth
- processing cost
- reduce communication cost
- data availability
- graph structure
- random walk
- vertex set
- wireless sensor networks
- feature selection
- neural network