论文标题
本地2分隔者
Local 2-separators
论文作者
论文摘要
如何将稀疏图理论扩展到大型网络，其中使用顶点数量估算其运行时间的算法不够好？我通过引入图形的“本地分离器”来解决这个问题。应用程序包括： 1。沿其局部2分隔符的图形的独特分解定理，类似于2分隔符定理； 2。具有无界细分的图形的精确表征。
How can sparse graph theory be extended to large networks, where algorithms whose running time is estimated using the number of vertices are not good enough? I address this question by introducing 'Local Separators' of graphs. Applications include: 1. A unique decomposition theorem for graphs along their local 2-separators analogous to the 2-separator theorem; 2. an exact characterisation of graphs with no bounded subdivision of a wheel.
