scientific article; zbMATH DE number 175833

MaRDI QIDQ4034894zbMATH OpenFDO

Authors L. I. Tyagunov

Publication date 18 May 1993

zbMATH Keywords

kernelNP-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Recommendations

• Even kernels
• scientific article; zbMATH DE number 958366
• On the complexity of the 3-kernel problem in some classes of digraphs
• Overview of some solved NP-complete problems in graph theory
• NP-completeness of some problems of partitioning and covering in graphs

Cited in

(6)

• Linearly-growing reductions of Karp's 21 NP-complete problems
• On the classification of NP-complete problems in terms of their correlation coefficient
• Even kernels
• scientific article; zbMATH DE number 958366 (Why is no real title available?)
• Overview of some solved NP-complete problems in graph theory
• scientific article; zbMATH DE number 5320331 (Why is no real title available?)

This page was built for publication:

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