4865 search results - page 175 / 973 » The Complexity of Graph Connectivity |
137
click to vote
CN
1998
15 years 3 months ago
1998
Connection preemption provides available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, o...
107
click to vote
ACSC
2007
IEEE
15 years 10 months ago
2007
IEEE
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
107
Voted
GG
2004
Springer
15 years 9 months ago
2004
Springer
There would seem to be a natural connection between graphs and information security. This is particularly so in the arena of access control and authorization. Research on applying ...
136
Voted
DM
2008
15 years 3 months ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
107
click to vote
JSAC
2008
15 years 3 months ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...