Different Volume Computation Methods of Graph Polytopes
Daeseok Lee, Hyeong-Kwan Ju
TL;DR
This paper introduces multiple methods for computing the volume of graph polytopes, including a recursive formula that simplifies volume calculation for any finite simple graph.
Contribution
It presents new volume computation techniques, notably a recursive formula, for graph polytopes associated with various finite simple graphs.
Findings
Recursive volume formula (RVF) for graph polytopes
Applicable to arbitrary finite simple graphs
Enhanced efficiency in volume computation
Abstract
The aim of this work is to introduce several different volume computation methods of the graph polytope associated with various type of finite simple graphs. Among them, we obtained the recursive volume formula (RVF) that is fundamental and most useful to compute the volume of the graph polytope for an arbitrary finite simple graph.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Complexity and Algorithms in Graphs