The lexicographically first topological order problem is NLOG-complete

DOI10.1016/0020-0190(89)90189-0zbMath0689.68070OpenAlexW2050015733MaRDI QIDQ582104

Takayoshi Shoudai

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90189-0

zbMATH Keywords

computational complexitytopological sortNLOG-complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Complexity of computation (including implicit computational complexity) (03D15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Depth-first search is inherently sequential
• Parallelism and the maximal path problem
• A parallelizable lexicographically first maximal edge-induced subgraph problem
• A taxonomy of problems with fast parallel algorithms
• Nondeterministic Space is Closed under Complementation
• Parallel Matrix and Graph Algorithms

This page was built for publication: The lexicographically first topological order problem is NLOG-complete