1101 search results - page 78 / 221 » An Algorithm for the Graph Crossing Number Problem |
138
Voted
ISAAC
2010
Springer
15 years 17 days ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
131
Voted
SIROCCO
2007
15 years 4 months ago
2007
We consider the problem of periodic exploration of all nodes in undirected graphs by using a nite state automaton called later a robot. The robot, using a constant number of state...
122
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
137
Voted
JSAC
2008
15 years 2 months ago
2008
Suppose we have a directed graph G with set of nodes V = {1, . . . , N} and a measure xi for every node i V . The average consensus problem consists in computing the average xA = ...
129
Voted
GD
2009
Springer
15 years 7 months ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...