3268 search results - page 279 / 654 » The hub number of a graph |
198
click to vote
JGAA
2000
15 years 6 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
179
click to vote
DMGT
2011
14 years 10 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...
108
Voted
CDC
2008
IEEE
16 years 1 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...
182
click to vote
GD
2001
Springer
15 years 11 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...
160
click to vote
TC
1998
15 years 6 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...