Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

FUIN
2006

favoriteEmaildiscussreport

90views more FUIN 2006»

Local Computations in Graphs: The Case of Cellular Edge Local Computations

13 years 4 months ago

Local Computations in Graphs: The Case of Cellular Edge Local Computations

Download www.cmi.univ-mrs.fr

We examine the power and limitations of the weakest vertex relabelling system which allows to change a label of a vertex in function of its own label and of the label of one of its neighbours. We characterize the graphs for which two important distributed algorithmic problems are solvable in this model : naming and election.

Jérémie Chalopin, Yves Métivi

Real-time Traffic

Algorithmic Problems | FUIN 2006 | Label | Weakest Vertex |

claim paper

Related Content

» Cellular Automata Based Optical Flow Computation for JustinTime Applications

» Local Maximal Matching and Local 2Approximation for Vertex Cover in UDGs

» Local Computation of Nearly Additive Spanners

» Edge local complementation and equivalence of binary linear codes

» Local polyhedra and geometric graphs

» Local Edge Colouring of YaoLike Subgraphs of Unit Disk Graphs

» Universal Rigidity and Edge Sparsification for Sensor Network Localization

» Costbased closedcontour representations

» Position Estimation Error in Edge Detection for Wireless Sensor Networks using Local Conve...

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	FUIN
Authors	Jérémie Chalopin, Yves Métivier, Wieslaw Zielonka

Comments (0)