Linear Time Split Decomposition Revisited

Pierre Charbit 1, 2 Fabien de Montgolfier 1, 2 Mathieu Raffinot 1
2 GANG - Networks, Graphs and Algorithms
LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00921774
Contributor : Fabien de Montgolfier <>
Submitted on : Saturday, December 21, 2013 - 1:11:50 AM
Last modification on : Friday, April 19, 2019 - 11:12:03 AM
Long-term archiving on : Friday, March 21, 2014 - 10:06:01 PM

File

split.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot. Linear Time Split Decomposition Revisited. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2012, 26 (2), pp.499-514. ⟨10.1137/10080052X⟩. ⟨hal-00921774⟩

Share

Metrics

Record views

287

Files downloads

416