Hyperbolic intersection graphs and (quasi)-polynomial time

DOI10.1137/1.9781611975994.100OpenAlexW3002091431MaRDI QIDQ5146878

Sándor Kisfaludi-Bak

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.03960

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (2)

Quasipolynomiality of the Smallest Missing Induced Subgraph ⋮ Clique-based separators for geometric intersection graphs

This page was built for publication: Hyperbolic intersection graphs and (quasi)-polynomial time