Sciweavers

1736 search results - page 253 / 348
» The rank-width of Directed Graphs
Sort
View
DISOPT
2008
107views more  DISOPT 2008»
15 years 4 months ago
The k-path tree matroid and its applications to survivable network design
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
Esther M. Arkin, Refael Hassin
ARSCOM
2006
81views more  ARSCOM 2006»
15 years 4 months ago
A Counting of the minimal realizations of the posets of dimension two
The posets of dimension 2 are those posets whose minimal realizations have two elements, that is, which may be obtained as the intersection of two of their linear extensions. Gall...
Pierre Ille, Jean-Xavier Rampon
CN
2006
98views more  CN 2006»
15 years 4 months ago
Internet resiliency to attacks and failures under BGP policy routing
We investigate the resiliency of the Internet at the Autonomous System (AS) level to failures and attacks, under the real constraint of business agreements between the ASs. The ag...
Danny Dolev, Sugih Jamin, Osnat Mokryn, Yuval Shav...
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 4 months ago
A field-theory motivated approach to symbolic computer algebra
Field theory is an area in physics with a deceptively compact notation. Although general purpose computer algebra systems, built around generic list-based data structures, can be ...
Kasper Peeters
CORR
2007
Springer
108views Education» more  CORR 2007»
15 years 4 months ago
Scuba Search : when selection meets innovation
— We proposed a new search heuristic using the scuba diving metaphor. This approach is based on the concept of evolvability and tends to exploit neutrality in fitness landscape....
Sébastien Vérel, Philippe Collard, M...