The complexity of recognizing geometric hypergraphs

DOI10.5802/IGT.9MaRDI QIDQ6988916zbMATH OpenFDO

Authors Daniel Bertschinger, Nicolas El Maalouly, Linda Kleist, Tillmann Miltzow, Simon Weber

Publication date 30 April 2025

Published in Innovations in Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://dspace.library.uu.nl/handle/1874/430449

zbMATH Keywords

computational complexityballhypergraphrecognitionconvexellipsoidgeometric hypergraphhalfspacetranslatehomothethalfplanebi-curveddifference-separable

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Hypergraphs (05C65)

This page was built for publication: The complexity of recognizing geometric hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988916)