Skip to content

Pre-filter zero-degree vertices before solver invocation#16

Open
adthoms wants to merge 1 commit into
MIT-SPARK:masterfrom
adthoms:worktree-agent-a0aed381
Open

Pre-filter zero-degree vertices before solver invocation#16
adthoms wants to merge 1 commit into
MIT-SPARK:masterfrom
adthoms:worktree-agent-a0aed381

Conversation

@adthoms
Copy link
Copy Markdown

@adthoms adthoms commented Apr 15, 2026

Summary

  • Adds O(N) pre-filter in FindInlierStructure to remove isolated (degree-0) vertices before passing graph to k-core or max-clique solvers
  • Builds a compacted graph with remapped vertex IDs, runs solver on smaller graph, remaps results back
  • Handles edge cases: no isolated vertices (skip filter), all vertices isolated (return empty)

Test plan

  • Verify zero-degree vertex filtering test case with isolated vertices produces correct inlier set
  • Verify all-isolated edge case returns empty result
  • Verify no-isolated-vertices case passes through to solver unchanged
  • Regression test existing robin_test cases

🤖 Generated with Claude Code

Adds an O(N) pre-filter in FindInlierStructure that removes isolated
vertices before passing the graph to k-core or max-clique solvers.
When most correspondences are outliers, this dramatically reduces
solver input size. Vertices are remapped to a compact graph, solved,
then remapped back to original IDs.

Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

1 participant