Results 221 to 230 of about 295,579 (265)
Some of the next articles are maybe not open access.
On the Terminal Connection Problem
2021A connection tree of a graph G for a terminal set W is a tree subgraph T of G such that \({\text {leaves}}(T) \subseteq W \subseteq V(T)\). A non-terminal vertex of a connection tree T is called linker if its degree in T is exactly 2, and it is called router if its degree in T is at least 3. The Terminal connection problem (TCP) asks whether G admits a
Alexsander Andrade de Melo +2 more
openaire +1 more source
The Steiner connectivity problem
Mathematical Programming, 2012zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ralf Borndörfer +2 more
openaire +2 more sources
On Rooted Node-Connectivity Problems
Algorithmica, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Cheriyan +2 more
openaire +1 more source
The complexity of the reliable connectivity problem
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dimitris Kavadias +2 more
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
On the point-to-point connection problem
Information Processing Letters, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Madan Natu, Shu-Cherng Fang
openaire +2 more sources
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
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