128 search results - page 10 / 26 » Tractable Cover Compilations |
101
Voted
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
211
Voted
Book
"This document explains the concepts of Java Servlets and provides a step-by-step tutorial for writing HTTP Servlets with complete source code for the example Servlets. The tu...
103
click to vote
CCGRID
2003
IEEE
15 years 5 months ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
112
Voted
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
Given an arbitrary graph G = (V, E) and an additional set of admissible edges F, the Chordal Sandwich problem asks whether there exists a chordal graph (V, E F ) such that F F. ...
99
Voted
CASES
2006
ACM
15 years 6 months ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...