3204 search results - page 173 / 641 » The Alcuin Number of a Graph |
DMGT
2011
12 years 12 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
14 years 2 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...
GD
2001
Springer
14 years 25 days 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...
TC
1998
13 years 8 months ago
1998
—Loop networks (or Hamiltonian circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental...
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 3 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...