Beyond adjacency: Graph encoding with reachability and shortest paths
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916967710982144 |
|---|---|
| author | Zhang, Shiqiang Misener, Ruth |
| author_facet | Zhang, Shiqiang Misener, Ruth |
| contents | Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are typically addressed using heuristic methods, and it remains unclear how to systematically incorporate structural constraints to effectively reduce the search space. This paper introduces explicit optimization formulations for graph search space that encode properties such as reachability and shortest paths. We provide theoretical guarantees demonstrating the correctness and completeness of our graph encoding. To address the symmetry issues arising from graph isomorphism, we propose lexicographic constraints over neighborhoods to eliminate symmetries and theoretically prove that adding those constraints will not reduce the original graph space. Our graph encoding, along with the corresponding symmetry-breaking constraints, forms the basis for downstream optimization tasks over graph spaces. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_20247 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Beyond adjacency: Graph encoding with reachability and shortest paths Zhang, Shiqiang Misener, Ruth Optimization and Control Graph-structured data is central to many scientific and industrial domains, where the goal is often to optimize objectives defined over graph structures. Given the combinatorial complexity of graph spaces, such optimization problems are typically addressed using heuristic methods, and it remains unclear how to systematically incorporate structural constraints to effectively reduce the search space. This paper introduces explicit optimization formulations for graph search space that encode properties such as reachability and shortest paths. We provide theoretical guarantees demonstrating the correctness and completeness of our graph encoding. To address the symmetry issues arising from graph isomorphism, we propose lexicographic constraints over neighborhoods to eliminate symmetries and theoretically prove that adding those constraints will not reduce the original graph space. Our graph encoding, along with the corresponding symmetry-breaking constraints, forms the basis for downstream optimization tasks over graph spaces. |
| title | Beyond adjacency: Graph encoding with reachability and shortest paths |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2509.20247 |