Results 181 to 190 of about 275,844 (217)
Some of the next articles are maybe not open access.
A Systolic Design for Connectivity Problems
IEEE Transactions on Computers, 1984In this paper we present a design, suited to VLSI implementation, for a one-dimensional array to solve graph connectivity problems. The computational model is relatively primitive in that only the two end cells of the array can interact with the external environment and only adjacent cells in the array are allowed to communicate.
openaire +1 more source
The connected disk covering problem
Journal of Combinatorial Optimization, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yi Xu +3 more
openaire +2 more sources
More Problems Connected with Convexity
Canadian Mathematical Bulletin, 1968This is a continuation of the author's article [3], and it contains further problems connected with the theory of convex sets in En. To the list of general references in [3] may be added the recent book [2] on convex polyhedra.1) Let A and B be two convex bodies in E2 and let a packing P = {B1, B2, …} be an infinite sequence of homothetic images of B ...
openaire +2 more sources
On a Problem Connected with Quadratic Regression
Biometrika, 1960E(Y) = flo +/3lE(X) + ... +4kE(Xk). (1.2) If k 2 and f2 t 0 (k = 1 and Ih1 + 0) then we speak of quadratic (linear) regression. If k = 0, that is if E( YjX) = E( Y) almost everywhere, then we say that Y has constant regression on X. The coefficients ,80, ,l1, . . , Ak are called the regression coefficients. Let X1, X2, ..
Laha, R. G., Lukacs, E.
openaire +1 more source
Connectivity Problem in Wireless Networks
2010We study the complexity of the following connectivity problem in wireless networks: for a given placement of n nodes in the plane, the goal is to compute a channel and power assignment that forms strongly connected communication structure spanning all nodes.
Dariusz R. Kowalski, Mariusz A. Rokicki
openaire +1 more source
Connectivity as problem: security, mobility, liberals, and Christians
2017This chapter explores the notion of connectivity as making possible forms of security and mobility in different historical periods. Starting from a reflection on present day liberal forms of mobility and security that rely on the active circulation of various elements, the mainstay of the chapter is an exploration of a sixteenth century Christian ...
Lobo-Guerrero, Luis, Kuntz, Friederike
openaire +2 more sources
An extremal problem on the connectivity of graphs
Networks, 1984AbstractWe solve in this paper a problem proposed by Bi‐weng Zhu at the First Combinatorics and Graph Theory Conference of China. For the minimum degree δ, connectivity k, and line‐connectivity λ of a (p,q) graph, p,q fixed, the maximum values of δ ‐ k, δ ‐ λ, and λ ‐ k are given as well as extremal graphs for which these upper bounds are realized.
openaire +1 more source
The \(\gamma\)-connected assignment problem
Eur. J. Oper. Res., 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcus Poggi de Aragão, Eduardo Uchoa
openaire +2 more sources
Holomorphic Connections and Problems of Lifts
Chinese Annals of Mathematics, Series BzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Salimov, Arif, Gurbanova, Narmina
openaire +2 more sources
On the Maximum Connectivity Improvement Problem
2019In this paper, we define a new problem called the Maximum Connectivity Improvement (MCI) problem: given a directed graph \(G = (V,E)\), a weight function \(w:V \rightarrow \mathbb {N}_{\ge 0}\), a profit function \(p:V \rightarrow \mathbb {N}_{\ge 0}\), and an integer B, find a set S of at most B edges not in E that maximises \(f(S)=\sum _{v\in V}w_v ...
Federico Coro +2 more
openaire +2 more sources