"An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs."

Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno (1997)

> Home

Details and statistics

DOI: 10.1137/S0097539794270881

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/ShiouraTU97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/ShiouraTU97
Akiyoshi Shioura, Akihisa Tamura, Takeaki Uno:
An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs. SIAM J. Comput. 26(3): 678-692 (1997)

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.