A note on computing set overlap classes

DOI10.1016/j.ipl.2008.05.005zbMath1193.68283arXiv0711.4573OpenAlexW1986933608MaRDI QIDQ975443

Pierre Charbit, Fabien de Montgolfier, Mathieu Raffinot, Vincent Limouzy, Michaël Rao, Michel A. Habib

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0711.4573

zbMATH Keywords

graph algorithmsset systemoverlap class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Consecutive Ones Property Testing: Cut or Swap

Cites Work

• Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on computing set overlap classes