70 search results - page 2 / 14 » Safe separators for treewidth |
ENTCS
2006
13 years 5 months ago
2006
ENASE
2011
12 years 5 months ago
2011
STACS
2010
Springer
14 years 8 days ago
2010
Springer
Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of minimal triangulation problems including Minimum Fill-i...
STOC
2010
ACM
13 years 10 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ECOOP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents our ongoing research towards a safe system evolution. Our approach is based on data-centric, objectoriented systems. Within those systems we utilise (i) multi-...