Overlaying a hypergraph with a graph with bounded maximum degree

DOI10.1016/j.dam.2022.05.022zbMath1494.05079OpenAlexW4283029958WikidataQ114191432 ScholiaQ114191432MaRDI QIDQ5918772

Dorian Mazauric, Frédéric Havet, Viet-Ha Nguyen, Rémi Watrigant

Publication date: 4 August 2022

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

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

zbMATH Keywords

hypergraphscomplexity of algorithmcomputational structural biology

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Mathematical biology in general (92B99)

Cites Work

• Unnamed Item
• Graphs, networks and algorithms.
• Interval graph representation with given interval and intersection lengths
• A simple existence criterion for \((g<f)\)-factors
• On complexity of subset interconnection designs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Blocks of Hypergraphs
• Polynomial-Time Data Reduction for the Subset Interconnection Design Problem
• Hypergraph planarity and the complexity of drawing venn diagrams
• Matroids and Subset Interconnection Design
• Inferring Social Networks from Outbreaks
• Reducibility among Combinatorial Problems
• Constructing scalable overlays for pub-sub with many topics
• Algorithms and Implementation for Interconnection Graph Problem

This page was built for publication: Overlaying a hypergraph with a graph with bounded maximum degree