Sciweavers

1199 search results - page 120 / 240
» Graph Theory
Sort
View
DM
2008
82views more  DM 2008»
15 years 4 months ago
Problems and results in extremal combinatorics - II
Extremal Combinatorics is one of the central areas in Discrete Mathematics. It deals with problems that are often motivated by questions arising in other areas, including Theoreti...
Noga Alon
IJBC
2007
54views more  IJBC 2007»
15 years 4 months ago
Impact Dynamics of Large Dimensional Systems
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
Martin E. Homer, S. John Hogan
NETWORKS
2010
15 years 2 months ago
Optical index of fault tolerant routings in WDM networks
Maˇnuch and Stacho [7] introduced the problem of designing f-tolerant routings in optical networks, i.e., routings which still satisfy the given requests even if f failures occur...
Stéphane Bessy, Clément Lepelletier
CAP
2010
14 years 11 months ago
Parallel computation of the minimal elements of a poset
Computing the minimal elements of a partially ordered finite set (poset) is a fundamental problem in combinatorics with numerous applications such as polynomial expression optimiz...
Charles E. Leiserson, Marc Moreno Maza, Liyun Li, ...
JDCTA
2010
148views more  JDCTA 2010»
14 years 11 months ago
Application Research on Optimal Path Based on Genetic Algorithm
At present, China's automobile logistics cost accounts for more than 20% of the production of motor vehicles. Therefore, lowering logistics cost by seeking its best path is a...
Lilin Fan, Huili Meng