Sciweavers

828 search results - page 53 / 166
» Simplicial Powers of Graphs
Sort
View
DAGSTUHL
2006
13 years 10 months ago
Graphs and Circuits: Some Further Remarks
We consider the power of single level circuits in the context of graph complexity. We first prove that the single level conjecture fails for fanin-2 circuits over the basis {, , 1...
Stasys Jukna
SODA
2003
ACM
130views Algorithms» more  SODA 2003»
13 years 10 months ago
Directed scale-free graphs
We introduce a model for directed scale-free graphs that grow with preferential attachment depending in a natural way on the in- and out-degrees. We show that the resulting in- an...
Béla Bollobás, Christian Borgs, Jenn...
CPC
2006
93views more  CPC 2006»
13 years 8 months ago
Distribution of Vertex Degree in Web-Graphs
We give results for the age dependent distribution of vertex degree and number of vertices of given degree in the undirected web-graph process, a discrete random graph process int...
Colin Cooper
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 2 months ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
MONET
2006
157views more  MONET 2006»
13 years 8 months ago
Connectivity in Wireless Ad-hoc Networks with a Log-normal Radio Model
In this paper we study connectivity in wireless ad-hoc networks by modeling the network as an undirected geometric random graph. The novel aspect in our study is that for finding t...
Ramin Hekmat, Piet Van Mieghem