Publication:4281695
From MaRDI portal
zbMath0942.68649MaRDI QIDQ4281695
Publication date: 14 August 2000
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C20: Directed graphs (digraphs), tournaments
Related Items
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, Sorting, linear time and the satisfiability problem