Sciweavers

1215 search results - page 202 / 243
» Combinatorics
Sort
View
DCG
2006
78views more  DCG 2006»
14 years 9 months ago
A Geometric Study of the Split Decomposition
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral geometry. By regarding finite metrics as discrete ...
Hiroshi Hirai
JCB
2008
144views more  JCB 2008»
14 years 9 months ago
Multi-Break Rearrangements and Breakpoint Re-Uses: From Circular to Linear Genomes
Multi-break rearrangements break a genome into multiple fragments and further glue them together in a new order. While 2-break rearrangements represent standard reversals, fusions...
Max A. Alekseyev
JCO
2006
128views more  JCO 2006»
14 years 9 months ago
A combinatorial theorem on labeling squares with points and its application
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
Binhai Zhu, Minghui Jiang
MP
2006
77views more  MP 2006»
14 years 9 months ago
Zigzag inequalities: a new class of facet-inducing inequalities for Arc Routing Problems
In this paper we introduce a new class of facet-inducing inequalities for the Windy Rural Postman Problem and the Windy General Routing Problem. These inequalities are called Zigz...
Angel Corberán, Isaac Plana, José M....
94
Voted
IANDC
2007
66views more  IANDC 2007»
14 years 9 months ago
Exponential lower bounds for the number of words of uniform length avoiding a pattern
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
Jason P. Bell, Teow Lim Goh