"Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ..."

K.-P. Kugler, Uwe Pape (1980)

> Home

Details and statistics

DOI: 10.1007/BF02281731

access: closed

type: Journal Article

metadata version: 2020-08-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/computing/KuglerP80
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/computing/KuglerP80
K.-P. Kugler, Uwe Pape:
Algorithmus 41 Ein Algorithmus zum vollständigen Durchlaufen eines ungerichteten, zusammenhängenden Graphen. Computing 24(2-3): 269-274 (1980)

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.