Sciweavers

1370 search results - page 103 / 274
» On grids in topological graphs
Sort
View
SIROCCO
2004
15 years 7 months ago
Time Efficient Gossiping in Known Radio Networks
We study here the gossiping problem (all-to-all communication) in known radio networks, i.e., when all nodes are aware of the network topology. We start our presentation with a det...
Leszek Gasieniec, Igor Potapov, Qin Xin
JCT
2006
134views more  JCT 2006»
15 years 6 months ago
MacLane's planarity criterion for locally finite graphs
MacLane's planarity criterion states that a finite graph is planar if and only if its cycle space has a basis B such that every edge is contained in at most two members of B....
Henning Bruhn, Maya Jakobine Stein
JCT
2006
79views more  JCT 2006»
15 years 6 months ago
A characterization of cocircuit graphs of uniform oriented matroids
The cocircuit graph of an oriented matroid is the 1-skeleton of the cellular decomposition induced by the Topological Representation Theorem due to Folkman and Lawrence (1978) [J....
Juan José Montellano-Ballesteros, Ricardo S...
CORR
2012
Springer
200views Education» more  CORR 2012»
14 years 2 months ago
Harmonic evolutions on graphs
We define the harmonic evolution of states of a graph by iterative application of the harmonic operator (Laplacian over Z2). This provides graphs with a new geometric context and...
Jerzy Kocik
IPPS
2006
IEEE
16 years 12 days ago
Speeding up NGB with distributed file streaming framework
Grid computing provides a very rich environment for scientific calculations. In addition to the challenges it provides, it also offers new opportunities for optimization. In this ...
Bingchen Li, Kang Chen, Zhiteng Huang, H. L. Rajic...