Sciweavers

491 search results - page 78 / 99
» On cyclically orientable graphs
Sort
View
EJC
2011
13 years 2 months ago
Distributive lattices, polyhedra, and generalized flows
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
Stefan Felsner, Kolja B. Knauer
CIE
2008
Springer
13 years 9 months ago
A Simple P-Matrix Linear Complementarity Problem for Discounted Games
The values of a two-player zero-sum binary discounted game are characterized by a P-matrix linear complementarity problem (LCP). Simple formulas are given to describe the data of t...
Marcin Jurdzinski, Rahul Savani
COMBINATORICS
2006
107views more  COMBINATORICS 2006»
13 years 7 months ago
A Note on the Number of Hamiltonian Paths in Strong Tournaments
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
Arthur H. Busch
ISVD
2007
IEEE
14 years 1 months ago
Apollonius diagrams and the Representation of Sounds and Music
We introduce the use of weighted medial graph structures to represent sounds and musical events. Such structures permit the building of hierarchical neighborhood relationships (sy...
Alex McLean, Frederic F. Leymarie, Geraint A. Wigg...
GCB
2004
Springer
92views Biometrics» more  GCB 2004»
14 years 22 days ago
Syntenic Layout of Two Assemblies of Related Genomes
: To facilitate research in comparative genomics, sequencing projects are increasingly aimed at assembling the genomes of closely related organisms. Given two incomplete assemblies...
Olaf Delgado Friedrichs, Aaron L. Halpern, Ross Li...