5889 search results - page 352 / 1178 » Graph Layout Problems |
164
click to vote
DAM
2008
15 years 6 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
219
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...
177
Voted
ICCV
2009
IEEE
16 years 11 months ago
2009
IEEE
We introduce a new problem of automatic photo composition,
and present an effective technique for finding good
views within a panoramic scene. Instead of applying heuristic
rule...
137
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
High quality placement results are always produced at the cost of significant runtimes. In this paper, we study the trade-off between the overall quality and the runtime for stand...
166
click to vote
DATE
2007
IEEE
16 years 1 months ago
2007
IEEE
Design closure becomes hard to achieve at physical layout stage due to the emergence of long global interconnects. Consequently, interconnect planning needs to be integrated in hi...