Sciweavers

1332 search results - page 100 / 267
» Combinatorial Algorithms
Sort
View
ALGORITHMICA
2010
127views more  ALGORITHMICA 2010»
13 years 9 months ago
An Algorithm for Minimum Cost Arc-Connectivity Orientations
Given a 2k-edge-connected undirected graph, we consider to find a minimum cost orientation that yields a k-arc-connected directed graph. This minimum cost k-arc-connected orientat...
Satoru Iwata, Yusuke Kobayashi
EVOW
2012
Springer
12 years 4 months ago
HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This paper presents HyFlex, a software framework for the development of cross-domain search methodologies. The framework features a common software interface for dealing with diff...
Gabriela Ochoa, Matthew R. Hyde, Timothy Curtois, ...
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 10 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 9 months ago
Constructions for Difference Triangle Sets
—Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for differe...
Yeow Meng Chee, Charles J. Colbourn
DAM
1999
81views more  DAM 1999»
13 years 8 months ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano