Sciweavers

1395 search results - page 187 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
ALGOSENSORS
2004
Springer
15 years 3 months ago
On a Conjecture Related to Geometric Routing
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
Christos H. Papadimitriou, David Ratajczak
SAC
2000
ACM
15 years 2 months ago
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
Günther R. Raidl, Bryant A. Julstrom
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
15 years 1 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
ISMB
2003
14 years 11 months ago
Deriving phylogenetic trees from the similarity analysis of metabolic pathways
Comparative analysis of metabolic pathways in different genomes can give insights into the understanding of evolutionary and organizational relationships among species. This type ...
Maureen Heymans, Ambuj K. Singh
JMLR
2006
148views more  JMLR 2006»
14 years 10 months ago
Walk-Sums and Belief Propagation in Gaussian Graphical Models
We present a new framework based on walks in a graph for analysis and inference in Gaussian graphical models. The key idea is to decompose the correlation between each pair of var...
Dmitry M. Malioutov, Jason K. Johnson, Alan S. Wil...