scientific article; zbMATH DE number 512986

MaRDI QIDQ4281695zbMATH OpenFDO

Authors Solomampionona Ranaivoson

Publication date 14 August 2000

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(3)

• Sorting, linear time and the satisfiability problem
• Graph properties checkable in linear time in the number of vertices
• The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness

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 Q4281695)