Research map / Graph learning / Graph algorithms and clustering
Viewing Graph Solvability via Cycle Consistency
Federica Arrigoni, Andrea Fusiello, Elisa Ricci, Tomas Pajdla
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 changed | Where | Measured | Effect |
|---|---|---|---|
| use cycle-consistency formulation instead of Trager et al. | viewing graph solvability test · Minimal graph example 1 | number of unknowns: 120 -> 36 | Improved |
| use cycle-consistency formulation instead of Trager et al. | viewing graph solvability test · Minimal graph example 6 | number of unknowns: 312 -> 109 | Improved |
| use cycle-consistency formulation instead of Trager et al. | viewing graph solvability test · Minimal graph example 6 | number of equations: 384 -> 208 | Improved |
| change variables u = v/a so unknowns drop below the plain cycle formulation (ablation) | cycle-consistency formulation · minimal graphs | number of unknowns: 5m -> 5m - m + 1 | Improved |
| use Alg. 1 instead of Trager et al. test | solvability classification · 8-node minimal graphs | graphs left unknown: 5 -> 0 | Improved |
| use Alg. 1 instead of Trager et al. test | solvability classification · 9-node minimal graphs | graphs left unknown: 22 -> 0 | Improved |
| use Alg. 1 instead of Trager et al. test | solvability classification · 9-node minimal graphs | graphs found not solvable: 0 -> 10 | Improved |
| increase graph size from 10 to 90 nodes | Alg. 1 · minimal graphs | execution time: 1.6 s -> > 4 h | Hurt |
| apply Alg. 1 beyond sufficient/necessary conditions | solvability classification · Ellis Island sampled sub-graphs | solvable sub-graphs: 136 -> 166 | Improved |
| apply Alg. 1 beyond sufficient/necessary conditions | solvability classification · Madrid Metropolis sampled sub-graphs | solvable sub-graphs: 88 -> 116 | Improved |
| apply Alg. 1 on sampled real-data sub-graphs | solvability classification · Alcatraz Courtyard | solvable sub-graphs: 200 -> 200 | No clear effect |
Closest papers by meaning
- Revisiting Viewing Graph Solvability: An Effective Approach Based on Cycle Consistency (TPAMI 2022 · similarity 0.99)
- Viewing Graph Solvability in Practice (ICCV 2023 · similarity 0.97)
- A Direct Approach to Viewing Graph Solvability (ECCV 2024 · similarity 0.97)
- VisionGraph: Leveraging Large Multimodal Models for Graph Theory Problems in Visual Context (ICML 2024 · similarity 0.82)
- The Underappreciated Power of Vision Models for Graph Structural Understanding (NeurIPS 2025 · similarity 0.81)
- HIG: Hierarchical Interlacement Graph Approach to Scene Graph Generation in Video Understanding (CVPR 2024 · similarity 0.81)
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.
