SOURCE-LINKED INTELLIGENCE

M-Fibration Theory with Applications to Weighted Graphs

arXiv · AI, language, vision and robotics · article · Aug 26, 2026 · UTC

The purpose of this paper is to provide a general, comprehensive, theoretical framework that allows one to deal with fibrations on graphs labelled on a commutative monoid. This is a genuine extension of the theory of graph fibrations (as introduced in "Fibrations of Graphs" [Discrete Math., vol. 243, pp. 21-66, 2002]), that makes it possible to deal with weighted graphs, and also graphs labelled with other algebraic structures. The derived theory also lends itself naturally to consider approximate fibrations. As an example, we show how the derived theory can be applied to the reduction of weig

Read original source ↗ Open in workspace

recordType

paper

region

Global