Hypergraphs with polynomial representation: introducing \(r\)-splits
type: Item
instance of: scholarly article
title: Hypergraphs with polynomial representation: introducing \(r\)-splits
zbMATH Open document ID: 1546.05107
author: François Pitois
author: Mohammed Haddad
author: Hamida Seba
author: Olivier Togni
published in: Discrete Mathematics and Theoretical Computer Science. DMTCS
publication date: 2024-09-06T00:00:00Z
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C31
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 7908432
zbMATH Keywords: hypergraph
zbMATH Keywords: split decomposition
zbMATH Keywords: polynomial representation
MaRDI profile type: MaRDI publication profile
cites work: Twin-width I: Tractable FO Model Checking
cites work: Tree-representation of set families and applications to combinatorial decompositions
cites work: The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
cites work: Linear time split decomposition revisited
cites work: Handle-rewriting hypergraph grammars
cites work: Decomposition of Directed Graphs
cites work: A Combinatorial Decomposition Theory
cites work: Q4149476
cites work: Dynamic Distance Hereditary Graphs Using Split Decomposition
cites work: Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs
cites work: A survey of the algorithmic aspects of modular decomposition
cites work: Rank-width and vertex-minors
cites work: Approximating clique-width and branch-width
cites work: Graph minors. II. Algorithmic aspects of tree-width
DOI: 10.46298/DMTCS.10751
description: scientific article; zbMATH DE number 7908432