When can graph hyperbolicity be computed in linear time?
From MaRDI portal
Publication:5920105
DOI10.1007/978-3-319-62127-2_34zbMath1491.68143arXiv1702.06503OpenAlexW2592125861WikidataQ62039063 ScholiaQ62039063MaRDI QIDQ5920105
Rolf Niedermeier, George B. Mertzios, André Nichterlein, Till Fluschnik, Christian Komusiewicz, Nimrod Talmon
Publication date: 22 September 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06503
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (7)
A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs ⋮ Fast approximation and exact computation of negative curvature parameters of graphs ⋮ Efficient and Adaptive Parameterized Algorithms on Modular Decompositions ⋮ Unnamed Item ⋮ Parameterized aspects of triangle enumeration ⋮ Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs ⋮ Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs
This page was built for publication: When can graph hyperbolicity be computed in linear time?
