Erratum to: New clique and independent set algorithms for circle graphs

DOI10.1016/0166-218X(93)90038-PzbMath0799.05058OpenAlexW211593417MaRDI QIDQ1208478

Mikhail J. Atallah, Susanne E. Hambrusch, Alberto Apostolico

Publication date: 16 May 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)90038-p

zbMATH Keywords

corrigendum

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Longest increasing subsequences in windows based on canonical antichain partition ⋮ An output sensitive algorithm for computing a maximum independent set of a circle graph

This page was built for publication: Erratum to: New clique and independent set algorithms for circle graphs