Using Graph Isomorphism Network to Solve Graph Coloring Problem

Yicheng Zhang; Kai Zhang; Ni Wu

doi:10.1109/iccece61317.2024.10504151

ScienceGate Book Chapters

JOURNAL ARTICLE

Using Graph Isomorphism Network to Solve Graph Coloring Problem

Yicheng Zhang Kai Zhang Ni Wu

Year: 2024 Pages: 209-215

DOI: 10.1109/iccece61317.2024.10504151

Get Full-Text PDF Get Analytical Report

Keywords:

Graph coloring Graph isomorphism Subgraph isomorphism problem Computer science Induced subgraph isomorphism problem Graph factorization Graph homomorphism Graph Combinatorics Theoretical computer science Discrete mathematics Mathematics Voltage graph Line graph

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.06

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

Graph Theory and Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Advanced Graph Neural Networks

Physical Sciences → Computer Science → Artificial Intelligence

Using Graph Isomorphism Network to Solve Graph Coloring Problem

Metrics

Topics

Related Documents

Potential intersection to solve graph coloring problem

Memetic Algorithm to Solve Graph Coloring Problem

Efficient graph coloring problem solution using Graph Neural Network (GNN)

An Approach To Solve Graph Coloring Problem Using Adjacency Matrix

Graph isomorphism problem