AI Paper Atlas

Research map / Graph learning / GNN architectures

On the Solvability of Viewing Graphs

Matthew Trager, Brian Osserman, Jean Ponce

ECCV 2018 · Graph learning › GNN architectures · approach: Theory of graph convolutional networks · 14 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
use the sufficient 'moves' condition instead of only the necessary candidate conditionminimal viewing graph classification · n=8, e=11graphs proven solvable out of 36 candidates: 36 -> 31Mixed
use the sufficient 'moves' condition instead of only the necessary candidate conditionminimal viewing graph classification · n=9, e=12graphs proven solvable out of 28 candidates: 28 -> 5Hurt
rely on the moves criterion for small graphsminimal viewing graph classification · n<=7candidates recovered as solvable: 4 -> 4 (n=6); 3 -> 3 (n=7)Improved
use finite solvability linear method to check candidatesminimal viewing graph classification · n=9, e=12graphs verified solvable out of 28 candidates: 28 -> 27Mixed
use finite solvability linear method to check candidatesminimal viewing graph classification · n=8, e=11graphs verified solvable out of 36 candidates: 36 -> 36Improved

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