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}
}
  • Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot
  • Published in SIAM J. Discrete Math. 2012
  • Computer Science, Mathematics
  • 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. 

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    Figures and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 14 CITATIONS

    Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    P-FPT algorithms for bounded clique-width graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Fully polynomial FPT algorithms for some classes of bounded clique-width graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    Counting Partitions of Graphs

    VIEW 3 EXCERPTS
    CITES BACKGROUND
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 22 REFERENCES

    A certifying algorithm for the consecutive-ones property

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Decomposition of Directed Graphs

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Set overlap classes computation

    • M. Rao
    • source code
    • 2007
    VIEW 1 EXCERPT

    ? ? ? ? f ? ? ? ? ?

    • A ADoefaa, H. P. DOETSCH, DRAWENG TABLE, Hans Peter Doetsch
    • 2003
    VIEW 2 EXCERPTS

    Distance labeling scheme and split decomposition

    VIEW 1 EXCERPT

    PC trees and circular-ones arrangements

    VIEW 1 EXCERPT

    Graph Classes

    • A. Brandstädt, V. B. Le, J. S. Spinrad
    • SIAM Monographs
    • 1999
    VIEW 1 EXCERPT