Titlebook: SOFSEM 2010: Theory and Practice of Computer Science; 36th Conference on C Jan Leeuwen,Anca Muscholl,Bernhard Rumpe Conference proceedings

Pseudoephedrine

Approximability of Edge Matching Puzzles .. puzzle, with a $2 million prize for the first submitted correct solution. It is known [1] it is NP-hard to obtain an exact solution to Edge Matching Puzzles. We extend on that result by showing an approximation-preserving reduction from Max-3DM-B and thus proving that Edge Matching Puzzles do no

轻快走过

A Linear Time Algorithm for Finding Three Edge-Disjoint Paths in Eulerian Networkspaths .., .., and .., where .. connects nodes .. and .. (. = 1, 2, 3)..Results obtained by Robertson and Seymour by graph minor techniques imply a polynomial time solvability of this problem. The time bound of their algorithm is .(..) (hereinafter we assume . : = |.|, . : = |.|, . = .(.))..In this p

nullify

R-Programs: A Framework for Distributing XML Structural Joins across Function Callsingle operator with multiple inputs. However, in XQuery and XSLT, a twig pattern may be scattered across several functions (templates); thus, function integration is required before the application of a twig join operator. This paper presents R-programs – a novel evaluation framework based on an exp

分解

多嘴多舌

衰弱的心

A Kernel for Convex Recoloring of Weighted Forests-negative integer weight, and given is an integer .. In a recoloring, the color of some vertices is changed. We are looking for a recoloring such that each color class induces a subtree of . and such that the total weight of all recolored vertices is at most .. Our result generalizes a result by Bod

可用

Symbolic OBDD-Based Reachability Analysis Needs Exponential Spacelems are known to be PSPACE-hard if their input graphs are represented by OBDDs. Despite the hardness results there are not many concrete nontrivial lower bounds known for the complexity of problems on OBDD-represented graph instances. Computing the set of vertices that are reachable from some prede

一个姐姐

Ingest

Lessons in Software Evolution Learned by Listening to Smalltalkstrate how these lessons work in practice by reviewing a number of research projects that support software evolution by exploiting Smalltalk’s design. We conclude by summarizing open issues and challenges for change-enabled systems of the future.

Incise