Sciweavers

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

69

Voted

DMTCS
2010

favoriteEmaildiscussreport

135views Mathematics» more DMTCS 2010»

Covering codes in Sierpinski graphs

14 years 6 months ago

Covering codes in Sierpinski graphs

Download dmg.tuwien.ac.at

Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, M

Real-time Traffic

DMTCS 2010 | Sensor Networks |

claim paper

Related Content

» Identifying Codes and Covering Problems

» Counting in Graph Covers A Combinatorial Characterization of the Bethe Entropy Function

» On a New Class of Codes for Identifying Vertices in Graphs

» Weak sense of direction labelings and graph embeddings

» An Implementation of Indoor Location Detection Systems Based on Identifying Codes

» Identifying State Coding Conflicts in Asynchronous System Specifications Using Petri Net U...

» Loss Tomography in General Topologies with Network Coding

» Handling Control Data Flow Graphs for a Tightly Coupled Reconfigurable Accelerator

» Information Theory Inference and Learning Algorithms

Post Info
More Details (n/a)

Added	02 Mar 2011
Updated	02 Mar 2011
Type	Journal
Year	2010
Where	DMTCS
Authors	Laurent Beaudou, Sylvain Gravier, Sandi Klavzar, Matjaz Kovse, Michel Mollard

Comments (0)