Publication:3783600
From MaRDI portal
zbMath0642.68126MaRDI QIDQ3783600
Publication date: 1987
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
The lexicographically first topological order problem is NLOG-complete, A parallelizable lexicographically first maximal edge-induced subgraph problem, The complexity of circuit value and network stability, Efficient parallel algorithms for parameterized problems