Results 1  10
of
403,498
(Longpath
"... Experimental study on the effect of Cheonggye stream restoration on urban environment ..."
Abstract
 Add to MetaCart
Experimental study on the effect of Cheonggye stream restoration on urban environment
Long Path Problems
 Proceedings of the 3 rd Conference on Parallel Problems Solving from Nature
, 1994
"... . We demonstrate the interesting, counterintuitive result that simple paths to the global optimum can be so long that climbing the path is intractable. This means that a unimodal search space, which consists of a single hill and in which each point in the space is on a simple path to the global opt ..."
Abstract
 Add to MetaCart
. We demonstrate the interesting, counterintuitive result that simple paths to the global optimum can be so long that climbing the path is intractable. This means that a unimodal search space, which consists of a single hill and in which each point in the space is on a simple path to the global
Mixing Time And Long Paths In Graphs
 IN PROC. 13TH ACMSIAM SODA
, 2000
"... We prove that regular graphs with large degree and small mixing time contain long paths and some other families of graphs as subgraphs. We present then an efficient algorithm for finding long paths. We apply the results to size Ramsey numbers and selfavoiding walks in graphs. ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We prove that regular graphs with large degree and small mixing time contain long paths and some other families of graphs as subgraphs. We present then an efficient algorithm for finding long paths. We apply the results to size Ramsey numbers and selfavoiding walks in graphs.
On Extremal Graphs With No Long Paths
"... Connected graphs with minimum degree ffi and at least 2ffi + 1 vertices have paths with at least 2ffi + 1 vertices. We provide a characterization of all such graphs which have no longer paths. Extremal problems involving paths and cycles have been considered since the infancy of graph theory. The ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Connected graphs with minimum degree ffi and at least 2ffi + 1 vertices have paths with at least 2ffi + 1 vertices. We provide a characterization of all such graphs which have no longer paths. Extremal problems involving paths and cycles have been considered since the infancy of graph theory
Decomposing Graphs into Long Paths
, 2003
"... It is known that the edge set of a 2edgeconnected 3regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2edgeconnected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, andK4−e have no such decompositions. We construct ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is known that the edge set of a 2edgeconnected 3regular graph can be decomposed into paths of length 3. W. Li asked whether the edge set of every 2edgeconnected graph can be decomposed into paths of length at least 3. The graphs C3, C4, C5, andK4−e have no such decompositions. We
Negative eigenvectors, long paths and p*
"... Draft not for citation or distribution We will discuss the roles of positive and negative eigenvalues of the Normal spectrum in identifying long paths in a network. These roles may be understood in terms of the "vibrational modes " of the associated eigenvectors. Nodes clustered t ..."
Abstract
 Add to MetaCart
Draft not for citation or distribution We will discuss the roles of positive and negative eigenvalues of the Normal spectrum in identifying long paths in a network. These roles may be understood in terms of the "vibrational modes " of the associated eigenvectors. Nodes clustered
Token flow control
"... As companies move towards manycore chips, an efficient onchip communication fabric to connect these cores assumes critical importance. To address limitations to wire delay scalability and increasing bandwidth demands, stateoftheart onchip networks use a modular packetswitched design with route ..."
Abstract

Cited by 635 (35 self)
 Add to MetaCart
in the network and to bypass the router pipeline along those paths. These bypass paths are formed dynamically, can be arbitrarily long and, are highly flexible with the ability to match to a packetâs exact route. Hence, this allows packets to potentially skip all routers along their path from source
The SmallWorld Phenomenon: An Algorithmic Perspective
 in Proceedings of the 32nd ACM Symposium on Theory of Computing
, 2000
"... Long a matter of folklore, the “smallworld phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first to m ..."
Abstract

Cited by 824 (5 self)
 Add to MetaCart
Long a matter of folklore, the “smallworld phenomenon ” — the principle that we are all linked by short chains of acquaintances — was inaugurated as an area of experimental study in the social sciences through the pioneering work of Stanley Milgram in the 1960’s. This work was among the first
Results 1  10
of
403,498