1101 search results - page 160 / 221 » An Algorithm for the Graph Crossing Number Problem |
106
click to vote
RECOMB
2004
Springer
16 years 2 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
116
click to vote
TCS
2008
15 years 2 months ago
2008
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
113
click to vote
CORR
2002
Springer
15 years 2 months ago
2002
Springer
We consider the problem of cutting a subset of the edges of a polyhedral manifold surface, possibly with boundary, to obtain a single topological disk, minimizing either the total...
132
Voted
IJCM
2002
15 years 2 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
122
click to vote
CGO
2003
IEEE
15 years 6 months ago
2003
IEEE
Existing profile-guided partial redundancy elimination (PRE) methods use speculation to enable the removal of partial redundancies along more frequently executed paths at the expe...