Linear Time Split Decomposition Revisited

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-20395

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.