A New Approach for Speeding Up Enumeration Algorithms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Enumerating spanning and connected subsets in graphs and matroids
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Resource optimization algorithms for virtual private networks using the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
Listing minimal edge-covers of intersecting families with applications to connectivity problems
Discrete Applied Mathematics
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Algorithms for generating convex sets in acyclic digraphs
Journal of Discrete Algorithms
A new approach for speeding up enumeration algorithms and its application for matroid bases
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Output-sensitive listing of bounded-size trees in undirected graphs
ESA'11 Proceedings of the 19th European conference on Algorithms
An algorithm to generate all spanning trees with flow
Mathematical and Computer Modelling: An International Journal
Generating minimal k-vertex connected spanning subgraphs
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Journal of Intelligent Manufacturing
| Hi-index | 0.00 |
We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. ...