Sciweavers

1282 search results - page 102 / 257
» Signing on signing off
Sort
View
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 9 months ago
Load balancing and orientability thresholds for random hypergraphs
Let h > w > 0 be two fixed integers. Let H be a random hypergraph whose hyperedges are uniformly of size h. To w-orient a hyperedge, we assign exactly w of its vertices posi...
Pu Gao, Nicholas C. Wormald
DM
2008
69views more  DM 2008»
13 years 9 months ago
The signed-graphic representations of wheels and whirls
We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological...
Daniel C. Slilaty, Hongxun Qin
COMBINATORICS
2006
144views more  COMBINATORICS 2006»
13 years 9 months ago
Weighted Zeta Functions of Graph Coverings
We present a decomposition formula for the weighted zeta function of an irregular covering of a graph by its weighted L-functions. Moreover, we give a factorization of the weighte...
Iwao Sato
IPL
2008
86views more  IPL 2008»
13 years 9 months ago
A more efficient algorithm for perfect sorting by reversals
We describe a new algorithm for the problem of perfect sorting a signed permutation by reversals. The worst-case time complexity of this algorithm is parameterized by the maximum p...
Sèverine Bérard, Cedric Chauve, Chri...
JCT
2006
55views more  JCT 2006»
13 years 9 months ago
A proof of the q, t-square conjecture
We prove a combinatorial formula conjectured by Loehr and Warrington for the coefficient of the sign character in (pn). Here denotes the Bergeron-Garsia nabla operator, and pn is a...
Mahir Can, Nicholas A. Loehr