Results 1  10
of
813,827
On KOrdered Hamiltonian Graphs
 J. Graph Theory
, 1999
"... Abstract: A Hamiltonian graph G of order n is kordered, 2 ≤ k ≤ n, iffor every sequence v1,v2,...,vk of k distinct vertices of G, there exists a Hamiltonian cycle that encounters v1,v2,...,vk in this order. Define f(k, n) as the smallest integer m for which any graph on n vertices with minimum degr ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
Abstract: A Hamiltonian graph G of order n is kordered, 2 ≤ k ≤ n, iffor every sequence v1,v2,...,vk of k distinct vertices of G, there exists a Hamiltonian cycle that encounters v1,v2,...,vk in this order. Define f(k, n) as the smallest integer m for which any graph on n vertices with minimum
Degree Conditions For kordered Hamiltonian Graphs
, 2004
"... We show that in any graph G on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vertices x and y, we can fix the order of k vertices on a given cycle and find a hamiltonian cycle encountering these vertices in the same order, as long as k < n/12 and G is d(k+ 1)/2econnected. Further we ..."
Abstract
 Add to MetaCart
we show that every b3k/2cconnected graph on n vertices with d(x) + d(y) ≥ n for any two nonadjacent vertices x and y is kordered hamiltonian, i.e. for every ordered set of k vertices we can find a hamiltonian cycle encountering these vertices in the given order. Both connectivity bounds are best
New conditions for kordered Hamiltonian graphs
 ARS COMBINATORIA
, 2003
"... For a positive integer k, a graph G is kordered hamiltonian if for every ordered sequence of k vertices there is a hamiltonian cycle that encounters the vertices of the sequence in the given order. It is shown that if G is a graph of order n with 3 k n / 2, and deg(u) þ deg(v) n þ (3k 9)/2 for ever ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
for every pair u; v of nonadjacent vertices of G, then G is kordered hamiltonian. Minimum degree conditions are also given for
On kOrdered Bipartite Graphs
, 2003
"... In 1997, Ng and Schultz introduced the idea of cycle orderability. For a positive integer k, a graph G is kordered if for every ordered sequence of k vertices, there is a cycle that encounters the vertices of the sequence in the given order. If the cycle is also a hamiltonian cycle, then G is sa ..."
Abstract
 Add to MetaCart
is said to be kordered hamiltonian. We give minimum degree conditions and sum of degree conditions for nonadjacent vertices that imply a balanced bipartite graph to be kordered hamiltonian. For example, let G be a balanced bipartite graph on 2n vertices, n suciently large. We show that for any
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
Predicting Internet Network Distance with CoordinatesBased Approaches
 In INFOCOM
, 2001
"... In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which is bas ..."
Abstract

Cited by 633 (5 self)
 Add to MetaCart
In this paper, we propose to use coordinatesbased mechanisms in a peertopeer architecture to predict Internet network distance (i.e. roundtrip propagation and transmission delay) . We study two mechanisms. The first is a previously proposed scheme, called the triangulated heuristic, which
CONDENSATION  conditional density propagation for visual tracking
 International Journal of Computer Vision
, 1998
"... The problem of tracking curves in dense visual clutter is challenging. Kalman filtering is inadequate because it is based on Gaussian densities which, being unimodal, cannot represent simultaneous alternative hypotheses. The Condensation algorithm uses "factored sampling", previously appli ..."
Abstract

Cited by 1499 (12 self)
 Add to MetaCart
tracking of agile motion. Notwithstanding the use of stochastic methods, the algorithm runs in near realtime. Contents 1 Tracking curves in clutter 2 2 Discretetime propagation of state density 3 3 Factored sampling 6 4 The Condensation algorithm 8 5 Stochastic dynamical models for curve motion 10 6
Contour Tracking By Stochastic Propagation of Conditional Density
, 1996
"... . In Proc. European Conf. Computer Vision, 1996, pp. 343356, Cambridge, UK The problem of tracking curves in dense visual clutter is a challenging one. Trackers based on Kalman filters are of limited use; because they are based on Gaussian densities which are unimodal, they cannot represent s ..."
Abstract

Cited by 658 (24 self)
 Add to MetaCart
simultaneous alternative hypotheses. Extensions to the Kalman filter to handle multiple data associations work satisfactorily in the simple case of point targets, but do not extend naturally to continuous curves. A new, stochastic algorithm is proposed here, the Condensation algorithm  Conditional
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks
, 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract

Cited by 522 (8 self)
 Add to MetaCart
An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance
Community detection in graphs
, 2009
"... The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices of th ..."
Abstract

Cited by 801 (1 self)
 Add to MetaCart
The modern science of networks has brought significant advances to our understanding of complex systems. One of the most relevant features of graphs representing real systems is community structure, or clustering, i. e. the organization of vertices in clusters, with many edges joining vertices
Results 1  10
of
813,827