3204 search results - page 243 / 641 » The b-chromatic Number of a Graph |
110
Voted
DMGT
2011
14 years 4 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
CDC
2008
IEEE
15 years 7 months ago
2008
IEEE
— The study of the scattering data for a star-shape network of LC-transmission lines is transformed into the scattering analysis of a Schr¨odinger operator on the same graph. Th...
118
Voted
GD
2001
Springer
15 years 5 months ago
2001
Springer
In this paper, we study 3-dimensional orthogonal graph drawings. Motivated by the fact that only a limited number of layers is possible in VLSI technology, and also noting that a s...
142
Voted
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
16 years 7 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
212
click to vote
ICDE
2002
IEEE
16 years 2 months ago
2002
IEEE
Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching...