Comments on "$\mathcal{O}(m\cdot n)$ algorithms for the recognition and isomorphism problems on circular-arc graphs"

Documenti analoghi

• On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
  di: Krawczyk, Tomasz
  Pubblicazione: (2024)
• Characterization of Circular-arc Graphs: II. McConnell Flipping
  di: Cao, Yixin, et al.
  Pubblicazione: (2024)
• On generating $k$-factorable graphic sequences with connected (resp.no connected) $k$-factors
  di: Mukhopadhyay, Asish, et al.
  Pubblicazione: (2024)
• An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
  di: Sitters, René
  Pubblicazione: (2025)
• DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
  di: Bushnell, Brian
  Pubblicazione: (2026)