"Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs."

Hajo Broersma et al. (2013)

> Home

Details and statistics

DOI: 10.1007/S00453-011-9576-4

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BroersmaFHP13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BroersmaFHP13
Hajo Broersma, Fedor V. Fomin, Pim van 't Hof, Daniël Paulusma:
Exact Algorithms for Finding Longest Cycles in Claw-Free Graphs. Algorithmica 65(1): 129-145 (2013)

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.