Sciweavers

4934 search results - page 184 / 987
» complexity 2008
Sort
View
CJ
2008
69views more  CJ 2008»
15 years 4 months ago
Some Parameterized Problems On Digraphs
We survey results and open questions on complexity of parameterized problems on digraphs. The problems include the feedback vertex and arc set problems, induced subdigraph problem...
Gregory Gutin, Anders Yeo
ENTCS
2008
113views more  ENTCS 2008»
15 years 4 months ago
Automatic Verification of Combined Specifications: An Overview
This paper gives an overview of results of the project "Beyond Timed Automata" carried out in the Collaborative Research Center AVACS (Automatic Verification and Analysi...
Ernst-Rüdiger Olderog
DM
2006
78views more  DM 2006»
15 years 4 months ago
On polynomial digraphs
Let (x, y) be a bivariate polynomial with complex coefficients. The zeroes of (x, y) are given a combinatorial structure by considering them as arcs of a directed graph G(). This p...
Josep M. Brunat, Antonio Montes
IPL
2008
135views more  IPL 2008»
15 years 4 months ago
On the Positive-Negative Partial Set Cover problem
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...
Pauli Miettinen
DM
2007
84views more  DM 2007»
15 years 4 months ago
The topology of spaces of phylogenetic trees with symmetry
Natural Dowling analogues of the complex of phylogenetic trees are studied. Using discrete Morse theory, we find their homotopy types. In the process, the homotopy types of certai...
Axel Hultman