Computer Science – Discrete Mathematics
Scientific paper
2009-02-10
Computer Science
Discrete Mathematics
18 pages, submitted
Scientific paper
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.
Charbit Pierre
Montgolfier Fabien de
Raffinot Mathieu
No associations
LandOfFree
Linear Time Split Decomposition Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Linear Time Split Decomposition Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Time Split Decomposition Revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-20395