4171 search results - page 607 / 835 » Choice numbers of graphs |
136
click to vote
ESA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. We present a new algorithm that can output the rankdecomposition of width at most k of a graph if such exists. For that we use an algorithm that, for an input matroid rep...
162
click to vote
ESOP
2007
Springer
16 years 23 days ago
2007
Springer
We introduce COWS (Calculus for Orchestration of Web Services), a new foundational language for SOC whose design has been influenced by WS-BPEL, the de facto standard language for...
147
click to vote
ICOIN
2007
Springer
16 years 23 days ago
2007
Springer
Wireless Sensor Network (WSN) deployed in hostile environments suffers from severe security threats. In this paper, we propose a Secure Message Percolation (SMP) scheme for WSN. We...
168
click to vote
IDEAL
2007
Springer
16 years 23 days ago
2007
Springer
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
184
click to vote
LION
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...