1632 search results - page 39 / 327 » On special numberings of hypergraphs |
166
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— In a landmark paper [32], Papadimitriou introduced a number of syntactic subclasses of TFNP based on proof styles that (unlike TFNP) admit complete problems. A recent series of...
124
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
166
click to vote
FOCS
2007
IEEE
16 years 18 days ago
2007
IEEE
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum f...
130
click to vote
PKDD
2007
Springer
16 years 11 days ago
2007
Springer
The number of specialized databases in molecular biology is growing fast, as is the availability of molecular data. These trends necessitate the development of automatic methods fo...
143
click to vote
COMBINATORICS
2004
15 years 6 months ago
2004
Until now, the enumeration of connected graphs has been dealt with by probabilistic methods, by special combinatorial decompositions or by somewhat indirect formal series manipula...