1101 search results - page 51 / 221 » An Algorithm for the Graph Crossing Number Problem |
134
click to vote
GG
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
106
click to vote
NIPS
2008
15 years 3 months ago
2008
We continue our study of online prediction of the labelling of a graph. We show a fundamental limitation of Laplacian-based algorithms: if the graph has a large diameter then the ...
142
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
146
click to vote
CEC
2005
IEEE
15 years 4 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
148
click to vote
CCCG
2003
15 years 3 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....