1951 search results - page 140 / 391 » An algorithm for improving graph partitions |
202
click to vote
DRMTICS
2005
Springer
15 years 10 months ago
2005
Springer
Software security is a significant issue in the Internet age. In order to prevent software from piracy and unauthorized modification, many techniques have been developed. Softwar...
138
click to vote
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...
117
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in grap...
131
click to vote
CPC
2007
15 years 4 months ago
2007
Consider two graphs G1 and G2 on the same vertex set V and suppose that Gi has mi edges. Then there is a bipartition of V into two classes A and B so that for both i = 1, 2 we hav...
156
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...