Sciweavers

1215 search results - page 203 / 243
» Combinatorics
Sort
View
JUCS
2007
105views more  JUCS 2007»
14 years 9 months ago
Graded Sparse Graphs and Matroids
: Sparse graphs and their associated matroids play an important role in rigidity theory, where they capture the combinatorics of some families of generic minimally rigid structures...
Audrey Lee, Ileana Streinu, Louis Theran
APPML
2002
76views more  APPML 2002»
14 years 9 months ago
Proper gromov transforms of metrics are metrics
In phylogenetic analysis, a standard problem is to approximate a given metric by an additive metric. Here it is shown that, given a metric D defined on some finite set X and a non...
Andreas W. M. Dress
CORR
2002
Springer
175views Education» more  CORR 2002»
14 years 9 months ago
A continuation semantics of interrogatives that accounts for Baker's ambiguity
Wh-phrases in English have two important properties: first, they can appear both raised and in-situ; second, while in-situ wh-phrases can take semantic scope beyond the immediately...
Chung-chieh Shan
SIAMJO
2000
86views more  SIAMJO 2000»
14 years 9 months ago
On the SQAP-Polytope
The SQAP-polytope was associated to quadratic assignment problems with a certain symmetric objective function structure by Rijal (1995) and Padberg and Rijal (1996). We derive a te...
Michael Jünger, Volker Kaibel
ECCC
1998
117views more  ECCC 1998»
14 years 9 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay