Efficiently Scanning All Spanning Trees of an Undirected Graph
Year of publication: |
1995
|
---|---|
Authors: | Shioura, Akiyoshi ; Tamura, Akihisa |
Published in: |
Journal of the Operations Research Society of Japan : JORSJ. - Tokyo : Soc., ISSN 0453-4514, ZDB-ID 715544x. - Vol. 38.1995, 3, p. 331-353
|
Saved in:
Saved in favorites
Similar items by person
-
Time Bounds for Iterative Auctions: A Unified Approach by Discrete Convex Analysis
Murota, Kazuo, (2014)
-
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
Shioura, Akiyoshi, (2004)
-
Mccormick, S.Thomas, (2000)
- More ...