Sciweavers

696 search results - page 99 / 140
» A class of combinatorial identities
Sort
View
JACM
2007
115views more  JACM 2007»
15 years 6 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
JAIR
2007
141views more  JAIR 2007»
15 years 6 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
JCSS
2007
85views more  JCSS 2007»
15 years 6 months ago
A general dimension for query learning
We introduce a combinatorial dimension that characterizes the number of queries needed to exactly (or approximately) learn concept classes in various models. Our general dimension...
José L. Balcázar, Jorge Castro, Davi...
JCT
2010
112views more  JCT 2010»
15 years 4 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra
JGAA
2010
128views more  JGAA 2010»
15 years 4 months ago
Intersection Graphs of Pseudosegments: Chordal Graphs
We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that ca...
Cornelia Dangelmayr, Stefan Felsner, William T. Tr...