"A faster algorithm for computing the girth of planar and bounded genus graphs."

Hristo N. Djidjev (2010)

> Home

Details and statistics

DOI: 10.1145/1868237.1868240

access: closed

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/Djidjev10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/Djidjev10
Hristo N. Djidjev:
A faster algorithm for computing the girth of planar and bounded genus graphs. ACM Trans. Algorithms 7(1): 3:1-3:16 (2010)

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.