Different Volume Computation Methods of Graph Polytopes
From MaRDI portal
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.
Recommendations
- ON THE VOLUME OF GRAPH POLYTOPES
- scientific article; zbMATH DE number 431987
- Computing Volumes of Polyhedra
- scientific article; zbMATH DE number 1538124
- On the Complexity of Computing the Volume of a Polyhedron
- Volume of graph polytopes for the path-star type graphs
- Polytope Volume Computation
- Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes
- (Deterministic) algorithms that compute the volume of polytopes
Cites work
- Applications of functional analysis and operator theory
- Computing the Continuous Discretely
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3539473 (Why is no real title available?)
- On the enumeration of certain weighted graphs
- On the Sums ∑ k = -∞ ∞ (4k + 1) -n
- ON THE VOLUME OF GRAPH POLYTOPES
Cited in
(5)
This page was built for publication: Different Volume Computation Methods of Graph Polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4558070)
