Sciweavers

745 search results - page 29 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
COCOON
2007
Springer
16 years 20 days ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
MOBIHOC
2002
ACM
16 years 6 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter
TCBB
2011
15 years 1 months ago
Learning Genetic Regulatory Network Connectivity from Time Series Data
Recent experimental advances facilitate the collection of time series data that indicate which genes in a cell are expressed. This paper proposes an efficient method to generate th...
Nathan A. Barker, Chris J. Myers, Hiroyuki Kuwahar...
MICS
2008
124views more  MICS 2008»
15 years 5 months ago
Community Structures of Networks
We present an approach to studying the community structures of networks by using linear programming (LP). Starting with a network in terms of (a) a collection of nodes and (b) a co...
William Y. C. Chen, Andreas W. M. Dress, Winking Q...
ASUNAM
2011
IEEE
14 years 6 months ago
Content-based Modeling and Prediction of Information Dissemination
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
Kathy Macropol, Ambuj K. Singh