2137 search results - page 157 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
150
click to vote
BMCBI
2006
15 years 6 months ago
2006
Background: The problem of finding a Shortest Common Supersequence (SCS) of a set of sequences is an important problem with applications in many areas. It is a key problem in biol...
139
click to vote
AMC
2005
15 years 6 months ago
2005
In this paper, by using the theories and methods of mathematical analysis and computer algebra, a reliable algorithm of reduction of order approximation method for solving singula...
144
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
174
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
168
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
Graph-structured databases and related problems such as reachability query processing have been increasingly relevant to many applications such as XML databases, biological databas...