15 search results - page 3 / 3 » Distance-two labelings of digraphs |
ICPR
2000
IEEE
14 years 9 months ago
2000
IEEE
The segmentation of colored texture images is considered. Either luminance, color, and/or texture features could be used for segmentation. For luminance and color the classes are ...
CORR
1999
Springer
13 years 8 months ago
1999
Springer
In recent work we have presented a formal framework for linguistic annotation based on labeled acyclic digraphs. These `annotation graphs' oer a simple yet powerful method fo...
PODC
2003
ACM
14 years 1 months ago
2003
ACM
This paper presents compact roundtrip routing schemes with local tables of size ˜O( √ n) and stretch 6 for any directed network with arbitrary edge weights; and with local tabl...
DM
2008
13 years 8 months ago
2008
For a simple path Pr on r vertices, the square of Pr is the graph P2 r on the same set of vertices of Pr , and where every pair of vertices of distance two or less in Pr is connec...
WG
2010
Springer
13 years 6 months ago
2010
Springer
book Author Title 58 Bijo S Anand Atoms and clique separators in graph products 59 Asir T Domination in total graph of a commutative ring 60 Sharada B On the Neighbourhood Subdivi...