1664 search results - page 42 / 333 » Distance labeling in graphs |
COMBINATORICS
2007
14 years 12 months ago
2007
This work introduces the technique of using a carefully chosen determining set to prove the existence of a distinguishing labeling using few labels. A graph G is said to be d-dist...
103
click to vote
CHI
1999
ACM
15 years 4 months ago
1999
ACM
Models of learning and performing by exploration assume that the semantic distance between task descriptions and screen labels controls in part the usersÕ search strategies. Neve...
NAACL
2007
15 years 1 months ago
2007
An increasing number of NLP tasks require semantic labels to be assigned, not only to entities that appear in textual elements, but to the relationships between those entities. In...
MFCS
2007
Springer
15 years 6 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
101
click to vote
CMOT
2004
14 years 11 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...