1101 search results - page 96 / 221 » An Algorithm for the Graph Crossing Number Problem |
144
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
142
click to vote
TIT
2008
15 years 4 months ago
2008
Abstract--Max-product "belief propagation" (BP) is an iterative, message-passing algorithm for finding the maximum a posteriori (MAP) assignment of a discrete probability...
216
click to vote
EDBT
2011
ACM
14 years 8 months ago
2011
ACM
Graph clustering has generally concerned itself with clustering undirected graphs; however the graphs from a number of important domains are essentially directed, e.g. networks of...
148
click to vote
AAIM
2005
Springer
15 years 10 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
140
click to vote
ESA
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. Zigzag pocket machining (or 2D-milling) plays an important role in the manufacturing industry. The objective is to minimize the number of tool retractions in the zigzag m...