"On symbolic OBDD-based algorithms for the minimum spanning tree problem."

Beate Bollig (2012)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2011.11.029

access: open

type: Journal Article

metadata version: 2021-02-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/Bollig12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Bollig12
Beate Bollig:
On symbolic OBDD-based algorithms for the minimum spanning tree problem. Theor. Comput. Sci. 447: 2-12 (2012)

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.