Real-Time Vertex Cover for Structured Massive Graphs on ARM Hardware (RSP-VC)

Real-Time Vertex Cover for Structured Massive Graphs on ARM Hardware (RSP-VC) The Minimum Vertex Cover (MinVC) problem is fundamental to applications such as network monitoring, sensor placement, infrastructure protection, and epidemic intervention planning. However, state-of-the-art solvers are often too slow for real-time deployment in edge environments. We present the Real-time Structural Portfolio for Vertex Cover (RSP-VC), a solver that dynamically selects among four strategies based on structural analysis of the input graph: Bipartite coloring Greedy degree selection Maximal matching Probabilistic selection On structured graphs (e.g., lattices, grids, and infrastructure networks), RSP-VC exploits König’s theorem to produce provably optimal vertex covers in O(N) time.On general graphs, the solver falls back to competitive 2-approximation algorithms. Key Results (Snapdragon 8 Gen 2) Optimal solutions: Solves the 100³ cubic lattice (N = 1,000,000) in 13 ms Throughput: ~77 million nodes per second Versatility: Competitive solution quality on scale-free and random graphs (N = 100,000) in 7–15 ms RSP-VC demonstrates that structure-aware algorithms can run 4–5 orders of magnitude faster than local-search methods on edge hardware, enabling real-time deployment without cloud infrastructure. LICENSE AND INTELLECTUAL PROPERTY NOTICE This work is released under the PolyForm Noncommercial License 1.0.0. The materials contained in this record — including the paper, documentation, datasets, and any associated source code — describe the Real-time Structural Portfolio for Vertex Cover (RSP-VC) and its underlying structural decision methodology. Scope of Protection The license applies to all algorithmic and methodological contributions presented in this work, including but not limited to: Structure-aware portfolio selection for the Minimum Vertex Cover problem Automatic detection and exploitation of bipartite or near-bipartite structure Use of König’s theorem for linear-time optimal solutions on structured graphs Strategy selection based on graph topology or structural indicators Ultra-low-latency MinVC computation for edge or embedded environments Any system reproducing substantially similar functional behavior or performance characteristics Protection applies to the methodology, decision logic, and functional behavior, not only to specific code implementations. Noncommercial Use Permitted uses include: Academic research and publication Peer review and independent verification Personal study and experimentation Non-profit educational use Any resulting publication must properly cite the canonical source. Commercial Use Restriction Any commercial, corporate, governmental, financial, military, or revenue-generating use — in whole or in part, in any form or on any platform — requires explicit written authorization from the author. This includes, but is not limited to: Integration into commercial optimization or analytics software Use in network management, infrastructure monitoring, logistics, or planning systems Deployment in proprietary edge, mobile, or cloud services Hardware, firmware, or embedded implementations Functional Equivalence and Derivative Works License applicability is determined by functional equivalence, not by textual similarity. The license applies to: Any reimplementation in any programming language Any mathematically equivalent formulation producing substantially similar behavior or performance Any system reproducing the same structure-aware selection logic or real-time optimization capability There is no minimum code threshold (no de minimis exception). Extraction of small fragments, refactoring, translation, paraphrasing, or reimplementation after exposure to this work constitutes derivative use. Knowledge Contamination Any individual or entity that has reviewed, studied, tested, or otherwise been exposed to the materials in this record shall be considered knowledge-contaminated. Subsequent implementations by such parties are not considered clean-room unless supported by contemporaneous, auditable evidence of prior independent development. Versioning This record may contain multiple versions.Updates to presentation, terminology, benchmarks, or documentation do not alter: the core methodological contributions the scope of protection the license terms The most recent license and scope documents in the repository are authoritative. Contact Andrés Sebastián PiroloIndependent Researcher — Buenos Aires, ArgentinaORCID: 0009-0004-3899-1222✉️ apirolo@abc.gob.ar✉️ andrespirolo@gmail.com