再论线性时间分裂分解
Linear Time Split Decomposition Revisited
摘要：
给定基集合V的子集族F，其正交定义为不与F的任何元素重叠的子集族。使用这个工具，我们重新设计一个简单的线性时间算法的无向图分裂（也称为1-连接）分解的问题。
英文摘要：
Given a family F of subsets of a ground set V, its orthogonal is defined to be the family of subsets that do not overlap any element of F. Using this tool we revisit the problem of designing a simple linear time algorithm for undirected graph split (also known as 1-join) decomposition.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
