The minimum recoloring problem to eliminate p-illusion is NP-hard on general directed graphs and bipartite DAGs but solvable in polynomial time on trees, cycles, and outerplanar networks.
An nˆ5/2 algorithm for maximum matchings in bipartite graphs
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
DINO features combined with many-to-many association and the proposed Harmonic Consensus Maximization enable general visual features to compete with specialized models on out-of-distribution image matching and camera pose estimation.
citing papers explorer
-
Eliminating Illusion in Directed Networks
The minimum recoloring problem to eliminate p-illusion is NP-hard on general directed graphs and bipartite DAGs but solvable in polynomial time on trees, cycles, and outerplanar networks.