Computing partial hypergraphs of bounded width

DOI10.1016/j.dam.2022.12.025OpenAlexW4313479136MaRDI QIDQ2686128

Cyril Terrioux, Philippe Jégou, Nabil Adrar

Publication date: 24 February 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2022.12.025

zbMATH Keywords

bounded treewidthpartial hypergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Uses Software

• MiniCon
• HyperBench

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparsity. Graphs, structures, and algorithms
• The structure of graphs not admitting a fixed immersion
• Boolean-width of graphs
• On rigid circuit graphs
• Hybrid backtracking bounded by tree-decomposition of constraint networks
• A comparison of structural CSP decomposition methods
• MiniCon: a scalable algorithm for answering queries using views
• Networks of constraints: Fundamental properties and applications to picture processing
• Maximum likelihood bounded tree-width Markov networks
• Incidence matrices and interval graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Parameterized Algorithms for Modular-Width
• On the Desirability of Acyclic Database Schemes
• Degrees of acyclicity for hypergraphs and relational database schemes
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Constraint solving via fractional edge covers
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• HyperBench
• Maximum matching width: new characterizations and a fast algorithm for dominating set
• Reasoning with Probabilistic and Deterministic Graphical Models: Exact Algorithms
• Fundamentals of Computation Theory
• Properties and characterizations of k ‐trees

This page was built for publication: Computing partial hypergraphs of bounded width