AI Paper Atlas

Research map / Graph learning / GNN architectures

Approximation Ratios of Graph Neural Networks for Combinatorial Problems

Ryoma Sato, Makoto Yamada, Hisashi Kashima

NeurIPS 2019 · Graph learning › GNN architectures · approach: GNN generalization theory · 16 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add weak 2-coloring to node featuresCPNGNN · Minimum dominating setapproximation ratio: (Δ + 1) -> (\frac{\Delta + 1}{2})Improved
Replace weak 2-coloring with 2-coloringCPNGNN · Minimum dominating setapproximation ratio lower bound: \frac{\Delta + 1}{2}No clear effect
Add weak 2-coloring to node featuresCPNGNN · Maximum matchingapproximation ratio: For any α ∈ R⁺ -> (\frac{\Delta + 1}{2})Improved
Add 2-coloring to node featuresCPNGNN · Maximum matching on bipartite graphsapproximation ratio: For any 1 < αImproved
Use port numbering and neighbor-feature concatenationCPNGNN · Finding single leaf (four-node star)successful trials: none -> all trialsImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy