Finding triangles and other small subgraphs in geometric intersection graphs
From MaRDI portal
Publication:6538602
DOI10.1137/1.9781611977554.CH68MaRDI QIDQ6538602
Publication date: 14 May 2024
Related Items (2)
Distance queries over dynamic interval graphs ⋮ Algorithms and Turing kernels for detecting and counting small patterns in unit disk graphs
This page was built for publication: Finding triangles and other small subgraphs in geometric intersection graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6538602)