Sciweavers

124 search results - page 8 / 25
» Crossing Number of Toroidal Graphs
Sort
View
JCT
2007
90views more  JCT 2007»
13 years 7 months ago
On the maximum number of edges in quasi-planar graphs
A topological graph is quasi-planar, if it does not contain three pairwise crossing edges. Agarwal et al. [2] proved that these graphs have a linear number of edges. We give a sim...
Eyal Ackerman, Gábor Tardos
SIAMCOMP
2000
118views more  SIAMCOMP 2000»
13 years 7 months ago
On Bipartite Drawings and the Linear Arrangement Problem
The bipartite crossing number problem is studied, and a connection between this problem and the linear arrangement problem is established. It is shown that when the arboricity is ...
Farhad Shahrokhi, Ondrej Sýkora, Lás...
GD
2009
Springer
13 years 10 months ago
Complexity of Some Geometric and Topological Problems
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
Marcus Schaefer
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
13 years 7 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
STACS
2005
Springer
14 years 29 days ago
Connectivity for Wireless Agents Moving on a Cycle or Grid
Abstract. We present a mathematical model to analyse the establishment and maintenance of communication between mobile agents. We assume that the agents move through a fixed envir...
Josep Díaz-Giménez, Xavier Pé...