1101 search results - page 42 / 221 » An Algorithm for the Graph Crossing Number Problem |
109
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Algorithms based on simulating stochastic flows are a simple and natural solution for the problem of clustering graphs, but their widespread use has been hampered by their lack of...
109
click to vote
IROS
2007
IEEE
15 years 8 months ago
2007
IEEE
— A new solution to the Simultaneous Localization and Modelling problem is presented. It is based on the stochastic search of solutions in the state space to the global localizat...
134
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...
114
click to vote
STRINGOLOGY
2008
15 years 3 months ago
2008
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
135
click to vote
SWAT
2004
Springer
15 years 7 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...