6740 search results - page 276 / 1348 » An s -Hamiltonian Line Graph Problem |
124
click to vote
CPM
2004
Springer
15 years 6 months ago
2004
Springer
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
100
click to vote
FSTTCS
2007
Springer
15 years 7 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...
120
Voted
TAMC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. In this paper, we give streaming algorithms for some problems which are known to be in deterministic log-space, when the number of passes made on the input is unbounded. ...
113
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
The paper formulates and investigates the aggregation problem for synthesized mediators of Web services (SWMs). An SWM is a finite-state transducer defined in terms of templates...
102
Voted
GECCO
2004
Springer
15 years 6 months ago
2004
Springer
The prize-collecting Steiner tree problem on a graph with edge costs and vertex profits asks for a subtree minimizing the sum of the total cost of all edges in the subtree plus th...