1664 search results - page 102 / 333 » Distance labeling in graphs |
147
Voted
CORR
2007
Springer
15 years 4 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
129
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
131
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
Abstract— ACG (Adjacent Constraint Graph) is a general floorplan representation. The refinement of constraint graphs gives not only an efficient representation but also a repre...
137
click to vote
METRICS
2005
IEEE
15 years 10 months ago
2005
IEEE
Software architecture is an important form of abstraction, representing the overall system structure and the relationship among components. When software is modified from one ver...
133
click to vote
ECCC
2008
15 years 3 months ago
2008
Given a function f : {0, 1}n {0, 1}, let M (f) denote the smallest distance between f and a monotone function on {0, 1}n . Let M (f) denote the fraction of hypercube edges where f...