Linear Time Split Decomposition Revisited
Résumé
Given a family $\mathcal{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 $\mathcal{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.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...