Sciweavers

DM
2006
92views more  DM 2006»
13 years 4 months ago
Sums of powers of the degrees of a graph
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
Sebastian M. Cioaba
DAM
2006
47views more  DAM 2006»
13 years 4 months ago
Trees of extremal connectivity index
The connectivity index w(G) of a graph G is the sum of the weights (d(u)d(v)) of all edges uv of G, where is a real number ( = 0), and d(u) denotes the degree of the vertex u. Le...
Huiqing Liu, Mei Lu, Feng Tian
DM
2008
50views more  DM 2008»
13 years 4 months ago
Searching monotone multi-dimensional arrays
A d-dimensional array of real numbers is called monotone increasing if its entries are increasing along each dimension. Given An,d, a monotone increasing d-dimensional array with ...
Yongxi Cheng, Xiaoming Sun, Yiqun Lisa Yin
LICS
1996
IEEE
13 years 8 months ago
Integration in Real PCF
Real PCF is an extension of the programming language PCF with a data type for real numbers. Although a Real PCF definable real number cannot be computed in finitely many steps, it...
Abbas Edalat, Martín Hötzel Escard&oac...
LICS
1997
IEEE
13 years 8 months ago
Induction and Recursion on the Partial Real Line via Biquotients of Bifree Algebras
The partial real line is the continuous domain of compact real intervals ordered by reverse inclusion. The idea is that singleton intervals represent total real numbers, and that ...
Martín Hötzel Escardó, Thomas S...
FSTTCS
2003
Springer
13 years 9 months ago
Distance-Preserving Approximations of Polygonal Paths
Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
Joachim Gudmundsson, Giri Narasimhan, Michiel H. M...
MFCS
2005
Springer
13 years 10 months ago
On Beta-Shifts Having Arithmetical Languages
Let β be a real number with 1 < β < 2. We prove that the language of the β-shift is ∆0 n iff β is a ∆n-real. The special case where n is 1 is the independently inter...
Jakob Grue Simonsen
IPPS
2005
IEEE
13 years 10 months ago
Optimal Channel Assignments for Lattices with Conditions at Distance Two
The problem of radio channel assignments with multiple levels of interference can be modeled using graph theory. Given a graph G, possibly infinite, and real numbers k1, k2, . . ...
Jerrold R. Griggs, Xiaohua Teresa Jin
CIE
2009
Springer
13 years 11 months ago
First-Order Universality for Real Programs
J. Raymundo Marcial–Romero and M. H. Escard´o described onal programming language with an abstract data type Real for the real numbers and a non-deterministic operator rtest: Re...
Thomas Anberrée