42 search results - page 3 / 9 » A New Algorithm for the Hypergraph Transversal Problem |
129
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
We show that enumerating all minimal spanning and connected subsets of a given matroid is quasi-polynomially equivalent to the well-known hypergraph transversal problem, and thus ...
127
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
101
click to vote
ISCAS
1994
IEEE
15 years 6 months ago
1994
IEEE
In layout design nding e ciently good solutions to the hypergraph bipartitioning problem is of great importance. This paper introduces a new algorithm, the dynamic locking algorit...
122
click to vote
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We study the computational complexity of deciding the existence of a Hamiltonian Cycle in some dense classes of k-uniform hypergraphs. Those problems turned out to be, al...
109
click to vote
WG
2005
Springer
15 years 7 months ago
2005
Springer
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...