Search Results for author:
Found 5 papers, 3 papers with code
Stress-Plus-X (SPX) Graph Layout
Stress, edge crossings, and crossing angles play an important role in the quality and readability of graph drawings.
Multi-level Weighted Additive Spanners
In this paper, we consider a multi-level version of the subsetwise spanner in weighted graphs, where the vertices in $S$ possess varying level, priority, or quality of service (QoS) requirements, and the goal is to compute a nested sequence of spanners with the minimum number of total edges.
Discrete Mathematics
Computing Steiner Trees using Graph Neural Networks
Graph neural networks have been successful in many learning problems and real-world applications.
Nearly Optimal Steiner Trees using Graph Neural Network Assisted Monte Carlo Tree Search
Graph neural networks are useful for learning problems, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.
Graph Sparsifications using Neural Network Assisted Monte Carlo Tree Search
Graph neural networks have been successful for machine learning, as well as for combinatorial and graph problems such as the Subgraph Isomorphism Problem and the Traveling Salesman Problem.
