Sciweavers

3204 search results - page 218 / 641
» The b-chromatic Number of a Graph
Sort
View
COCOON
1999
Springer
14 years 3 months ago
On Routing in Circulant Graphs
We investigate various problems related to circulant graphs – finding the shortest path between two vertices, finding the shortest loop, and computing the diameter. These probl...
Jin-yi Cai, George Havas, Bernard Mans, Ajay Nerur...
ICPP
1997
IEEE
14 years 3 months ago
A Register Allocation Technique Using Register Existence Graph
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
Akira Koseki, Yoshiaki Fukazawa, Hideaki Komatsu
ACIIDS
2009
IEEE
89views Database» more  ACIIDS 2009»
14 years 2 months ago
Improving Efficiency and Scalability of Service Network Graph by Re-routing Service Routes
Inter domain service routing is an element in the success of Next Generation Network. Service requests, such as the INVITE request in Session Initiation Protocol [21] may need to ...
David Lai, Zhongwei Zhang
AGTIVE
2007
Springer
14 years 2 months ago
Specifying Domain-Specific Refactorings for AndroMDA Based on Graph Transformation
Abstract. Applying refactoring in a model-driven software engineering context raises many new challenges that need to be addressed. In this paper, we consider model-driven software...
Gabriele Taentzer, Dirk Müller 0002, Tom Mens
AIRS
2006
Springer
14 years 2 months ago
Natural Document Clustering by Clique Percolation in Random Graphs
Document clustering techniques mostly depend on models that impose explicit and/or implicit priori assumptions as to the number, size, disjunction characteristics of clusters, and/...
Wei Gao, Kam-Fai Wong