Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
From MaRDI portal
Publication:1363700
DOI10.1016/S0012-365X(96)00015-5zbMATH Open0880.05065MaRDI QIDQ1363700FDOQ1363700
Authors: Michel Minoux
Publication date: 19 January 1998
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- A combinatorial approach to matrix algebra
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- A combinatorial proof of the Cayley-Hamilton theorem
- Title not available (Why is that?)
Cited In (15)
- Extension of MacMahon's master theorem to pre-semi-rings
- Invertible matrices and semilinear spaces over commutative semirings
- Bideterminant and Generalized Kronecker-Capelli Theorem for Fuzzy Relation Equations
- The Markov chain tree theorem in commutative semirings and the state reduction algorithm in commutative semifields
- On generalized fuzzy matrices with periods
- Dioïds and semirings: Links to fuzzy sets and other applications
- On invertible matrices over antirings
- Some determinant expansions and the matrix-tree theorem
- Title not available (Why is that?)
- Around matrix-tree theorem
- On simultaneously nilpotent antiring matrices
- Determinant: Old algorithms, new insights
- On nilpotency of matrices over antirings
- On nilpotent matrices over antirings
- On nilpotency of generalized fuzzy matrices
This page was built for publication: Bideterminants, arborescences and extension of the matrix-tree theorem to semirings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363700)