Maximizing the Maximum Degree in Ordered Yao Graphs.
Péter ÁgostonAdrian DumitrescuArsenii SagdeevKaramjeet SinghJi ZengPublished in: CoRR (2024)
Keyphrases
- random graphs
- neural network
- ordered sets
- graph theoretic
- graph partitioning
- directed graph
- graph matching
- graph theory
- graph isomorphism
- degree distribution
- spanning tree
- data structure
- real time
- social network analysis
- series parallel
- graph kernels
- data mining
- power law
- machine learning
- graph representation
- graph model
- weighted graph
- graph structure