"Parallel Complexity of Depth-First-Search and Maximal Path in Restricted ..."

Archit Chauhan, Samir Datta, M. Praveen (2025)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2025.23

access: open

type: Conference or Workshop Paper

metadata version: 2025-12-11

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/ChauhanDP25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/ChauhanDP25
Archit Chauhan, Samir Datta, M. Praveen:
Parallel Complexity of Depth-First-Search and Maximal Path in Restricted Graph Classes. FSTTCS 2025: 23:1-23:21

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.