On the absolute and relative oriented clique problems' time complexity

DOI10.1016/J.PROCS.2023.08.238MaRDI QIDQ6885220zbMATH OpenFDO

Authors Erika M. M. Coelho, Hebert Coelho, Luerbio Faria, M. P. Ferreira, Sulamita Klein

Publication date 11 December 2025

Published in Procedia Computer Science (Search for Journal in Brave)

zbMATH Keywords

NP-completenessparameterized complexityoriented chromatic numbernon-appromabilityoriented absolute cliqueoriented relative clique

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)

This page was built for publication: On the absolute and relative oriented clique problems' time complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885220)