1461 search results - page 145 / 293 » Complexity of Graph Covering Problems |
PC
2000
14 years 10 months ago
2000
The LogP model is a model of parallel computation that characterises a parallel computer system by four parameters: the latency L, the overhead o, the gap g and the number of proc...
IWCMC
2009
ACM
15 years 2 months ago
2009
ACM
Autoconfiguration of the radio parameters is a key feature for next generation mobile networks. Especially for LTE the NGMN Forum has brought it up as a major requirement. It is ...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
An induced matching in graph G is a matching which is an induced subgraph of G. Clearly, among two vertices with the same neighborhood (called twins) at most one is matched in any...
WG
2004
Springer
15 years 3 months ago
2004
Springer
The Phylogenetic kth Root Problem (PRk) is the problem of finding a (phylogenetic) tree T from a given graph G = (V, E) such that (1) T has no degree-2 internal nodes, (2) the ex...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
We propose a new graph representation for ISI channels that can be used for combined equalization and decoding by linear programming (LP) or iterative message-passing (IMP) decodi...