A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Author:
- 25 June 1999
- book chapter
- Published by Springer Nature
- p. 349-359
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- New Approach for Speeding Up Enumeration AlgorithmsLecture Notes in Computer Science, 1998
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected GraphsSIAM Journal on Computing, 1997
- Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs1997