Sciweavers

5473 search results - page 86 / 1095
» On the graph isomorphism problem
Sort
View
AUSSOIS
2001
Springer
15 years 4 months ago
Exact Algorithms for NP-Hard Problems: A Survey
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open prob...
Gerhard J. Woeginger
DM
1999
61views more  DM 1999»
14 years 11 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
EVOW
2007
Springer
15 years 6 months ago
An Ant Algorithm for the Steiner Tree Problem in Graphs
The Steiner Tree Problem (STP) in graphs is a well-known
Luc Luyet, Sacha Varone, Nicolas Zufferey
SODA
2008
ACM
135views Algorithms» more  SODA 2008»
15 years 1 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the f...
Chandra Chekuri, Nitish Korula, Martin Pál
PPSN
2004
Springer
15 years 5 months ago
An Evolutionary Algorithm for the Maximum Weight Trace Formulation of the Multiple Sequence Alignment Problem
Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
Gabriele Koller, Günther R. Raidl