Sciweavers

22 search results - page 3 / 5
» Two disjoint negative cycles in a signed graph
Sort
View
COMBINATORICA
2011
12 years 5 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
PAMI
2002
184views more  PAMI 2002»
13 years 5 months ago
Identifying Faces in a 2D Line Drawing Representing a Manifold Object
A straightforward way to illustrate a 3D model is to use a line drawing. Faces in a 2D line drawing provide important information for reconstructing its 3D geometry. Manifold objec...
Jianzhuang Liu, Yong Tsui Lee, Wai-kuen Cham
TON
2010
152views more  TON 2010»
13 years 4 months ago
1 + N network protection for mesh networks: network coding-based protection using p-cycles
—p-Cycles have been proposed for preprovisioned 1 : N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the ...
Ahmed E. Kamal
STOC
2010
ACM
181views Algorithms» more  STOC 2010»
13 years 6 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
GC
2007
Springer
13 years 6 months ago
Local Topological Toughness and Local Factors
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
Frank Göring, Gyula Y. Katona