6740 search results - page 493 / 1348 » An s -Hamiltonian Line Graph Problem |
140
click to vote
IPL
2010
15 years 5 months ago
2010
We discuss multicasting for the n-cube network and its close variants, the Chord and the Binomial Graph (BNG) Network. We present simple transformations and proofs that establish ...
231
click to vote
WAW
2010
Springer
15 years 4 months ago
2010
Springer
We give an improved algorithm for computing personalized PageRank vectors with tight error bounds which can be as small as (n-p ) for any fixed positive integer p. The improved Pag...
191
click to vote
GC
2011
Springer
14 years 10 months ago
2011
Springer
The minimum clique partition (MCP) problem is that of partitioning the vertex set of a given graph into a minimum number of cliques. Given n points in the plane, the corresponding...
161
click to vote
ISAAC
2004
Springer
16 years 7 days ago
2004
Springer
Abstract. The rendezvous problem in graphs has been extensively studied in the literature, mainly using a randomized approach. Two mobile agents have to meet at some node of a conn...
277
click to vote
CPM
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. This paper addresses the problem of aligning multiple sequences of non-coding RNA genes. We approach this problem with the biologically motivated paradigm that scoring of...