OffStreamNG: Partial Stream Hybrid Graph Edge Partitioning Based on Neighborhood Expansion and Greedy Heuristic

Tewodros Alemu Ayall; Hancong Duan; Changhong Liu; Fantahun Bogale Gereme; Mesay Deleli

doi:10.1007/978-3-030-54623-6_11

ScienceGate Book Chapters

BOOK-CHAPTER

OffStreamNG: Partial Stream Hybrid Graph Edge Partitioning Based on Neighborhood Expansion and Greedy Heuristic

Tewodros Alemu Ayall Hancong Duan Changhong Liu Fantahun Bogale Gereme Mesay Deleli

Year: 2020 Communications in computer and information science Pages: 118-128 Publisher: Springer Science+Business Media

DOI: 10.1007/978-3-030-54623-6_11

Get Full-Text PDF Get Analytical Report

Keywords:

Graph partition Computer science Partition (number theory) Graph Edge contraction Vertex (graph theory) Parallel computing Algorithm Theoretical computer science Mathematics Combinatorics Line graph Graph power

Metrics

Cited By

0.37

FWCI (Field Weighted Citation Impact)

Refs

0.71

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Theory and Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Graph Neural Networks

Physical Sciences → Computer Science → Artificial Intelligence

OffStreamNG: Partial Stream Hybrid Graph Edge Partitioning Based on Neighborhood Expansion and Greedy Heuristic

Metrics

Citation History

Topics

Related Documents

Graph Edge Partitioning via Neighborhood Heuristic

Parallel Neighborhood Expansion Based Graph Edge Partitioning Algorithm

Taking Heuristic Based Graph Edge Partitioning One Step Ahead via OffStream Partitioning Approach

Parallel greedy graph matching using an edge partitioning approach

Graph isomorphism: A heuristic edge-partitioning-oriented algorithm