646 search results - page 24 / 130 » Generalized connected domination in graphs |
116
click to vote
FCT
2003
Springer
15 years 5 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
128
click to vote
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
SIAMDM
2000
14 years 11 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
JCT
2008
14 years 11 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
WWW
2006
ACM
16 years 13 days ago
2006
ACM
I present analysis examining some of the causes of poor connectivity in developing countries. Based on a technoeconomic analysis and design, I show that technical limitations per ...