{"paper":{"title":"Effect of Gromov-hyperbolicity Parameter on Cuts and Expansions in Graphs and Some Algorithmic Implications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.CC","authors_text":"Bhaskar DasGupta, Farzaneh Yahyanejad, Marek Karpinski, Nasim Mobasheri","submitted_at":"2015-10-29T16:56:12Z","abstract_excerpt":"$\\delta$-hyperbolic graphs, originally conceived by Gromov in 1987, occur often in many network applications; for fixed $\\delta$, such graphs are simply called hyperbolic graphs and include non-trivial interesting classes of \"non-expander\" graphs. The main motivation of this paper is to investigate the effect of the hyperbolicity measure $\\delta$ on expansion and cut-size bounds on graphs (here $\\delta$ need not be a constant), and the asymptotic ranges of $\\delta$ for which these results may provide improved approximation algorithms for related combinatorial problems. To this effect, we provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08779","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}