Sciweavers

27 search results - page 1 / 6
» Weak sense of direction labelings and graph embeddings
Sort
View
DAM
2011
13 years 2 months ago
Weak sense of direction labelings and graph embeddings
An edge-labeling λ for a directed graph G has a weak sense of direction (WSD) if there is a function f that satisfies the condition that for any node u and for any two label seq...
Christine T. Cheng, Ichiro Suzuki
IPL
2000
105views more  IPL 2000»
13 years 7 months ago
Coverings that preserve sense of direction
Sense of direction is a property of labelled networks (i.e., arc-coloured graphs) that allows one to assign coherently local identifiers to other processors on the basis of the ro...
Paolo Boldi, Sebastiano Vigna
SIROCCO
2000
13 years 8 months ago
Lower bounds for (weak) sense of direction
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
Paolo Boldi, Sebastiano Vigna
WDAG
2000
Springer
112views Algorithms» more  WDAG 2000»
13 years 11 months ago
More Lower Bounds for Weak Sense of Direction: The Case of Regular Graphs
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
Paolo Boldi, Sebastiano Vigna
EJC
2008
13 years 7 months ago
Labeled posets are universal
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. The homomorphicity order of k-posets is shown to be a distributive lattice. Homomorph...
Erkko Lehtonen