1554 search results - page 183 / 311 » Parameterized Complexity and Approximation Algorithms |
127
click to vote
GD
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
117
click to vote
ALMOB
2006
15 years 3 months ago
2006
The technique of Finite Markov Chain Imbedding (FMCI) is a classical approach to complex combinatorial problems related to sequences. In order to get efficient algorithms, it is k...
148
click to vote
GECCO
2005
Springer
15 years 8 months ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
116
click to vote
PODS
2000
ACM
15 years 7 months ago
2000
ACM
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
119
Voted
SODA
2010
ACM
16 years 20 days ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...