Computing \(H\)-joins with application to 2-modular decomposition
type: Item
instance of: scholarly article
title: Computing \(H\)-joins with application to 2-modular decomposition
zbMATH Open document ID: 1306.05235
author: Antoine Mamcarz
author: Fabien De Montgolfier
author: M. A. Habib
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6387689
zbMATH Keywords: graph decompositions
zbMATH Keywords: \(H\)-join
zbMATH Keywords: homogeneous pairs
MaRDI profile type: Publication
full work available at URL: s00453-013-9820-1
OpenAlex ID: W2068211971
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth
cites work: Boolean-width of graphs
cites work: Detecting 2-joins faster
cites work: Linear time split decomposition revisited
cites work: Partitive hypergraphs
cites work: Bull-free Berge graphs are perfect
cites work: Balanced \(0,\pm 1\) matrices. I: Decomposition
cites work: A Combinatorial Decomposition Theory
cites work: An algorithm for finding homogeneous pairs
cites work: Two algorithms for general list matrix partitions
cites work: List Partitions
cites work: Algorithms for Some H-Join Decompositions
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT
cites work: Three Partition Refinement Algorithms
DOI: 10.1007/S00453-013-9820-1
description: scientific article; zbMATH DE number 6387689