Sciweavers

44 search results - page 6 / 9
» On the maximum number of edges in topological graphs with no...
Sort
View
SIAMDM
2010
128views more  SIAMDM 2010»
13 years 6 months ago
Permutation Capacities of Families of Oriented Infinite Paths
K¨orner and Malvenuto asked whether one can find n n/2 linear orderings (i.e., permutations) of the first n natural numbers such that any pair of them places two consecutive int...
Graham Brightwell, Gérard D. Cohen, Emanuel...
GLOBECOM
2007
IEEE
14 years 2 months ago
Loss Tomography in General Topologies with Network Coding
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
Minas Gjoka, Christina Fragouli, Pegah Sattari, At...
JGAA
2002
86views more  JGAA 2002»
13 years 7 months ago
Planar Graphs with Topological Constraints
We address in this paper the problem of constructing embeddings of planar graphs satisfying declarative, user-defined topological constraints. The constraints consist each of a cy...
Christoph Dornheim
ENDM
2007
106views more  ENDM 2007»
13 years 7 months ago
Removing Even Crossings on Surfaces
In this paper we investigate how certain results related to the HananiTutte theorem can be extended from the plane to surfaces. We give a simple topological proof that the weak Ha...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
GC
2007
Springer
13 years 7 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