Exact Vertex Cover on Spatial Scale-Free Graphs: Uniform Separators, Corridor Branching, and the CROWN Meta-Algorithm

We study exact Vertex Cover on spatial scale-free random graphs through a model-agnostic framework (CROWN) that covers Euclidean GIRGs and, via a standard mapping, HRGs. Our main structural result is a uniform separator theorem with a closed-form expo

Authors

Ankit Chauhan (ORCID: https://orcid.org/0000-0003-2766-7422)

Institutions

Infosys (India) (IN)

Publication Details

Published: 2025-09-25
DOI: https://doi.org/10.36227/techrxiv.175877787.74593011/v1
Primary Topic: Computational Geometry and Mesh Generation
Type: article
Field-Weighted Citation Impact: 0.00

Controls

|||

ALL TIME

JAN

FEB

MAR

APR

MAY

JUN

JUL

AUG

SEP

OCT

article

Exact Vertex Cover on Spatial Scale-Free Graphs: Uniform Separators, Corridor Branching, and the CROWN Meta-Algorithm

Ankit Chauhan

Sep 25, 2025

Computational Geometry and Mesh Generation

article

Exact Vertex Cover on Spatial Scale-Free Graphs: Uniform Separators, Corridor Branching, and the CROWN Meta-Algorithm

Ankit Chauhan

September 25, 2025article en

Abstract

Infosys (India) (IN)

Openalex Percentile: Top 53%

Computational Geometry and Mesh Generation

DOI Open Access PDF OpenAlex

AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Exact Vertex Cover on Spatial Scale-Free Graphs: Uniform Separators, Corridor Branching, and the CROWN Meta-Algorithm — Ankit Chauhan · (2025) | TGRS Research Map | TGRS