2432 search results - page 26 / 487 » Degrees and choice numbers |
110
click to vote
IPPS
1999
IEEE
15 years 6 months ago
1999
IEEE
A binary-tree algorithm, Bin(n), proceeds level-bylevel from the leaves of a 2n -leaf balanced binary tree to its root. This paper deals with running binary-tree algorithms on mul...
DM
2010
15 years 1 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
100
Voted
JGT
2010
15 years 9 days ago
2010
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
TIT
2011
14 years 8 months ago
2011
—Secure communication protocols over a single-relay system in the presence of a multiple-antenna eavesdropper are investigated. When there is no direct link between the source an...
109
click to vote
SSS
2009
Springer
15 years 8 months ago
2009
Springer
In recent years peer-to-peer (P2P) technology has been adopted by Internet-based malware as a fault tolerant and scalable communication medium for self-organization and survival. I...