跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09262 · v1

Path Isolation and Reachability in Surface-Embedded Graphs with Restricted Cycle and Cut Structure

首次提交 2026-11-06 18:20
版本更新 2026-11-06 18:20
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

We study the reachability problem in directed surface-embedded graphs under two structural restrictions, using isolating weight assignments. First, we consider graphs whose underlying undirected embeddings contain at most polynomially many simple surface non-separating cycles. We develop a polynomially bounded, logspace-computable skew-symmetric edge-weight assignment with nonzero circulation around every simple cycle. This yields an unambiguous logspace (UL) upper bound for directed reachability. The construction also gives an SPL upper bound for bipartite perfect matching in the corresponding undirected graph class. Second, for gg-genus directed graphs admitting a balanced hierarchical genus decomposition with O(log⁡n)O(\log n) crossing edges at every partition, we obtain an unambiguous O(log⁡g⋅log⁡n)O(\log g \cdot \log n)-space bound for reachability. Our approach combines path-isolating weights for lower-genus subgraphs using polynomially bounded FKS hashing refinements at successive merging levels.

作者备注:18 pages. 1 figure

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 18:20 · 最新观测版本

Path Isolation and Reachability in Surface-Embedded Graphs with Restricted Cycle and Cut Structure

We study the reachability problem in directed surface-embedded graphs under two structural restrictions, using isolating weight assignments. First, we consider graphs whose underlying undirected embeddings contain at most polynomially many simple surface non-separating cycles. We develop a polynomially bounded, logspace-computable skew-symmetric edge-weight assignment with nonzero circulation around every simple cycle. This yields an unambiguous logspace (UL) upper bound for directed reachability. The construction also gives an SPL upper bound for bipartite perfect matching in the corresponding undirected graph class. Second, for gg-genus directed graphs admitting a balanced hierarchical genus decomposition with O(log⁡n)O(\log n) crossing edges at every partition, we obtain an unambiguous O(log⁡g⋅log⁡n)O(\log g \cdot \log n)-space bound for reachability. Our approach combines path-isolating weights for lower-genus subgraphs using polynomially bounded FKS hashing refinements at successive merging levels.

查看此版本解读 →查看此版本原文 ↗