15974 search results - page 2935 / 3195 » Object-Oriented Software Engineering |
143
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
144
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
124
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
146
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...
124
click to vote
FSTTCS
2007
Springer
15 years 10 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...