Linear Time Split Decomposition Revisited
classification
💻 cs.DM
cs.DS
keywords
decompositionfamilylinearsplitsubsetstimealgorithmdefined
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.