Results 11 to 20 of about 35,950 (265)
Geometric Biplane Graphs I: Maximal Graphs [PDF]
Graphs and Combinatorics, 2015 We study biplane graphs drawn on a finite planar point set $S$ in general position. This is the family of geometric graphs whose vertex set is $S$ and can be decomposed into two plane graphs. We show that two maximal biplane graphs---in the sense that no edge can be added while staying biplane---may differ in the number of edges, and we provide an ...
Garcia Olaverri, Alfredo Martin +7 more
openaire +5 more sources
Neighborhood hypergraph model for topological data analysis
Computational and Mathematical Biophysics, 2022 Hypergraph, as a generalization of the notions of graph and simplicial complex, has gained a lot of attention in many fields. It is a relatively new mathematical model to describe the high-dimensional structure and geometric shapes of data sets.
Liu Jian, Chen Dong, Li Jingyan, Wu Jie
doaj +1 more source
Geometric Biplane Graphs II: Graph Augmentation [PDF]
Graphs and Combinatorics, 2015 We study biplane graphs drawn on a finite point set $S$ in the plane in general position. This is the family of geometric graphs whose vertex set is $S$ and which can be decomposed into two plane graphs. We show that every sufficiently large point set admits a 5-connected biplane graph and that there are arbitrarily large point sets that do not admit ...
Hurtado Díaz, Fernando Alfredo +7 more
openaire +5 more sources
Infinite Random Geometric Graphs [PDF]
Annals of Combinatorics, 2011 17 pages, 4 ...
Bonato, Anthony, Janssen, Jeannette
openaire +3 more sources
The Erdős-Sós conjecture for geometric graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Combinatorics
Luis Barba +6 more
doaj +1 more source
Bidimensionality and Geometric Graphs [PDF]
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012 In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and subexponential time parameterized algorithms for problems on classes of graphs which are not minor closed, but instead exhibit a geometric structure. In particular we present EPTASs and subexponential time parameterized algorithms for
Fedor V. Fomin +2 more
openaire +2 more sources
Directed random geometric graphs [PDF]
Journal of Complex Networks, 2019 Abstract Many real-world networks are intrinsically directed. Such networks include activation of genes, hyperlinks on the internet and the network of followers on Twitter among many others. The challenge, however, is to create a network model that has many of the properties of real-world networks such as power-law degree distributions ...
Michel, Jesse +4 more
openaire +2 more sources
Geometric inhomogeneous random graphs [PDF]
Theoretical Computer Science, 2019 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bringmann, K. ; https://orcid.org/0000-0003-1356-5177 +2 more
openaire +4 more sources
SYNCHRONIZATION IN RANDOM GEOMETRIC GRAPHS [PDF]
International Journal of Bifurcation and Chaos, 2009 In this paper, we study the synchronization properties of random geometric graphs. We show that the onset of synchronization takes place roughly at the same value of the order parameter as a random graph with the same size and average connectivity.
Díaz-Guilera, Albert +3 more
openaire +3 more sources
Proximity Structures for Geometric Graphs [PDF]
International Journal of Computational Geometry & Applications, 2003 In this paper we study proximity graph structures like Delaunay triangulations based on geometric graphs, i.e. graphs which are subgraphs of the complete geometric graph. Given an arbitrary geometric graph G, we define Voronoi diagrams, Delaunay triangulations, relative neighborhood graphs, Gabriel graphs which are related to the graph structure and ...
Kapoor, Sanjiv, Li, Xiang-Yang
openaire +1 more source