61 search results - page 6 / 13 » Lower bounds for graph embeddings and combinatorial precondi... |
133
click to vote
GD
2000
Springer
15 years 5 months ago
2000
Springer
An orthogonal drawing of a graph is an embedding of the graph in the rectangular grid, with vertices represented by axis-aligned boxes, and edges represented by paths in the grid w...
127
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
114
click to vote
CRYPTO
2006
Springer
15 years 5 months ago
2006
Springer
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
126
Voted
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The crossing number of a graph is the least number of pairwise edge crossings in a drawing of the graph in the plane. We provide an O(n log n) time constant factor approximation al...
121
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...