725 search results - page 59 / 145 » Bounding Degrees on RPL |
86
Voted
EJC
2007
15 years 20 days ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
97
Voted
TWC
2010
14 years 7 months ago
2010
Abstract--In this paper, we deal with the performance of nonorthogonal Amplify-and-Forward protocols over block-fading channels (BFNAF), where the source retransmits the same data ...
107
click to vote
SIAMDM
2008
15 years 19 days ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
81
Voted
STACS
1991
Springer
15 years 4 months ago
1991
Springer
Bracket languages play an important role in the syntax analysis of programming languages. We investigate the parallel recognition and analysis of these languages as a first step ...
109
click to vote
CCCG
2010
15 years 2 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...