"Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees."

Gal Dahan et al. (2024)

> Home

Details and statistics

DOI: 10.1609/SOCS.V17I1.31539

access: open

type: Conference or Workshop Paper

metadata version: 2024-06-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/socs/DahanTSD24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/socs/DahanTSD24
Gal Dahan, Itay Tabib, Solomon Eyal Shimony, Yefim Dinitz:
Generalized Longest Simple Path Problems: Speeding up Search Using SPQR Trees. SOCS 2024: 28-36

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.