Linear Time Split Decomposition Revisited

@article{Charbit2012LinearTS,
  title={Linear Time Split Decomposition Revisited},
  author={Pierre Charbit and Fabien de Montgolfier and Mathieu Raffinot},
  journal={SIAM J. Discrete Math.},
  year={2012},
  volume={26},
  pages={499-514}
}
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. 

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 30 references

Decomposition of directed graphs

W. H. Cunningham
SIAM Journal on Algebraic Discrete Methods, 3 • 1982
View 4 Excerpts
Highly Influenced

Parallel Algorithms for Hierarchical Clustering and Cluster Validity

IEEE Trans. Pattern Anal. Mach. Intell. • 1990
View 4 Excerpts
Highly Influenced

F

P. Charbit, M. Habib, V. Limouzy
de Montgolfier, M. Raffinot, and M. Rao, A note on computing set overlap classes, Information Processing Letters, 108 • 2008
View 2 Excerpts

Partition re  nement techniques : an interesting algorithmic toolkit

C. Paul, L. Viennot.
Algorithms and Computation • 2007

Set overlap classes computation

M. Rao
source code • 2007
View 1 Excerpt

Similar Papers

Loading similar papers…