109 search results - page 11 / 22 » Watermarking Graph Partitioning Solutions |
101
Voted
MFCS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
110
click to vote
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
136
click to vote
ICDM
2006
IEEE
15 years 5 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
TVLSI
2002
14 years 11 months ago
2002
In this paper, we deal with arbitrarily shaped rectilinear module placement using the transitive closure graph (TCG) representation. The geometric meanings of modules are transpare...
97
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Parallelization of sequential programs is often daunting because of the substantial development cost involved. Various solutions have been proposed to address this concern, includ...