1383 search results - page 170 / 277 » On the Complexity of the Interlace Polynomial |
189
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
166
click to vote
NCA
2009
IEEE
16 years 1 months ago
2009
IEEE
—Web caching and replication techniques increase accessibility of Web contents and reduce Internet bandwidth requirements. In this paper, we are considering the replica placement...
161
click to vote
CPM
2009
Springer
16 years 1 months ago
2009
Springer
Evolution is usually described as a phylogenetic tree, but due to some exchange of genetic material, it can be represented as a phylogenetic network which has an underlying tree st...
147
click to vote
FCT
2009
Springer
16 years 1 months ago
2009
Springer
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...
159
click to vote
FM
2009
Springer
16 years 1 months ago
2009
Springer
Statecharts and Petri nets are two popular visual formalisms for modelling complex systems that exhibit concurrency. Both formalisms are supported by various design tools. To enabl...