A Two-Phase Heuristic Algorithm for Effective Graph Partitioning

Anirudha Ghosh; Anil Tudu; Ankita Mardana; Debaditya Barman

doi:10.1109/calcon63337.2024.10914188

ScienceGate Book Chapters

JOURNAL ARTICLE

A Two-Phase Heuristic Algorithm for Effective Graph Partitioning

Anirudha Ghosh Anil Tudu Ankita Mardana Debaditya Barman

Year: 2024 Pages: 1-6

DOI: 10.1109/calcon63337.2024.10914188

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Algorithm Heuristic Graph Algorithm design Theoretical computer science Mathematical optimization Mathematics Artificial intelligence

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.44

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Manufacturing Process and Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Optimization and Packing Problems

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

A Two-Phase Heuristic Algorithm for Effective Graph Partitioning

Metrics

Topics

Related Documents

Multilevel Heuristic Algorithm for Graph Partitioning

Graph isomorphism: A heuristic edge-partitioning-oriented algorithm

TWO-LEVEL GRAPH PARTITIONING ALGORITHM

The dynamic locking heuristic-a new graph partitioning algorithm

An effective algorithm for genealogical graph partitioning