Showing 2026Show all
2 papers · 1 filter
cs.DS2026
Solving Vertex Integrity Faster than
Sandip Das, Sweta Das, Sk Samim Islam +3
Vertex Integrity is a classical graph parameter measuring the vulnerability of a network to vertex failures. We settle two fundamental questions concerning its exact exponential co…
cs.DS2026
Minimum eccentricity shortest paths of -minor-free graphs
Dibyayan Chakraborty, Sandip Das, Sk Samim Islam +2
Given a simple, undirected, and unweighted graph , and an integer , the objective of the \textsc{Minimum Eccentricity Shortest Path (MESP)} is to decide whether there exists…