Maximum Plane Trees in Multipartite Geometric Graphs

Algorithmica ◽  
2018 ◽  
Vol 81 (4) ◽  
pp. 1512-1534 ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
Kimberly Crosbie ◽  
Jean-Lou De Carufel ◽  
David Eppstein ◽  
...  
Keyword(s):  
Geometric Graphs ◽  
Plane Trees ◽  
Multipartite Geometric Graphs

Maximum Plane Trees in Multipartite Geometric Graphs

2017 ◽  
pp. 193-204
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
Kimberly Crosbie ◽  
Jean-Lou De Carufel ◽  
David Eppstein ◽  
...  
Keyword(s):  
Geometric Graphs ◽  
Plane Trees ◽  
Multipartite Geometric Graphs

scholarly journals Partitions of Complete Geometric Graphs into Plane Trees

2005 ◽  
pp. 71-81
Author(s):  
Prosenjit Bose ◽  
Ferran Hurtado ◽  
Eduardo Rivera-Campo ◽  
David R. Wood
Keyword(s):  
Geometric Graphs ◽  
Plane Trees

scholarly journals Partitions of complete geometric graphs into plane trees

2006 ◽  
Vol 34 (2) ◽  
pp. 116-125 ◽  
Author(s):  
Prosenjit Bose ◽  
Ferran Hurtado ◽  
Eduardo Rivera-Campo ◽  
David R. Wood
Keyword(s):  
Geometric Graphs ◽  
Plane Trees

scholarly journals Spanning Trees in Multipartite Geometric Graphs

Algorithmica ◽  
2017 ◽  
Vol 80 (11) ◽  
pp. 3177-3191 ◽  
Author(s):  
Ahmad Biniaz ◽  
Prosenjit Bose ◽  
David Eppstein ◽  
Anil Maheshwari ◽  
Pat Morin ◽  
...  
Keyword(s):  
Spanning Trees ◽  
Geometric Graphs ◽  
Multipartite Geometric Graphs

scholarly journals An optimal algorithm for plane matchings in multipartite geometric graphs

2017 ◽  
Vol 63 ◽  
pp. 1-9
Author(s):  
Ahmad Biniaz ◽  
Anil Maheshwari ◽  
Subhas C. Nandy ◽  
Michiel Smid
Keyword(s):  
Optimal Algorithm ◽  
Geometric Graphs ◽  
Multipartite Geometric Graphs

scholarly journals Normalized Sombor Indices as Complexity Measures of Random Networks

Entropy ◽  
2021 ◽  
Vol 23 (8) ◽  
pp. 976
Author(s):  
R. Aguilar-Sánchez ◽  
J. Méndez-Bermúdez ◽  
José Rodríguez ◽  
José Sigarreta
Keyword(s):  
Random Matrix ◽  
Adjacency Matrix ◽  
Matrix Theory ◽  
Computational Study ◽  
Random Networks ◽  
Geometric Graphs ◽  
Theory Approach ◽  
Complexity Measures ◽  
Random Geometric Graphs ◽  
Highly Correlated

We perform a detailed computational study of the recently introduced Sombor indices on random networks. Specifically, we apply Sombor indices on three models of random networks: Erdös-Rényi networks, random geometric graphs, and bipartite random networks. Within a statistical random matrix theory approach, we show that the average values of Sombor indices, normalized to the order of the network, scale with the average degree. Moreover, we discuss the application of average Sombor indices as complexity measures of random networks and, as a consequence, we show that selected normalized Sombor indices are highly correlated with the Shannon entropy of the eigenvectors of the adjacency matrix.

scholarly journals Geometric graphs from data to aid classification tasks with Graph Convolutional Networks

Patterns ◽  
2021 ◽  
Vol 2 (4) ◽  
pp. 100237
Author(s):  
Yifan Qian ◽  
Paul Expert ◽  
Pietro Panzarasa ◽  
Mauricio Barahona
Keyword(s):  
Geometric Graphs ◽  
Convolutional Networks ◽  
Classification Tasks

scholarly journals Connectivity in one-dimensional soft random geometric graphs

2020 ◽  
Vol 102 (6) ◽  
Author(s):  
Michael Wilsher ◽  
Carl P. Dettmann ◽  
Ayalvadi Ganesh
Keyword(s):  
Geometric Graphs ◽  
Random Geometric Graphs ◽  
One Dimensional
Sign in / Sign up

Export Citation Format

Share Document