5889 search results - page 221 / 1178 » Graph Layout Problems |
178
click to vote
ESA
1997
Springer
15 years 10 months ago
1997
Springer
In thispaper we introduce a new class of dynamicgraphalgorithmscalledquasi-fully dynamic algorithms,which are much more general than the backtracking algorithmsand are much simple...
271
click to vote
BMCBI
2010
15 years 1 months ago
2010
Background: Linking high-throughput experimental data with biological networks is a key step for understanding complex biological systems. Currently, visualization tools for large...
179
click to vote
ACCV
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we propose an efficient method for finding consistent correspondences between two sets of features. Our matching algorithm augments the discriminative pow...
195
click to vote
LICS
2008
IEEE
16 years 27 days ago
2008
IEEE
The study of constraint satisfaction problems definable in various fragments of Datalog has recently gained considerable importance. We consider constraint satisfaction problems ...
150
click to vote
4OR
2007
15 years 6 months ago
2007
Abstract We show that a well-known linearization technique initially proposed for quadratic assignment problems can be generalized to a broader class of quadratic 0-1 mixed-integer...