Pages that link to "Item:Q5902170"

The following pages link to Matrices and matroids for systems analysis (Q5902170):

Displaying 17 items.

• Shortest bibranchings and valuated matroid intersection (Q1926655) (← links)
• Computing valuations of the Dieudonné determinants (Q2100059) (← links)
• Global structure identifiability and reconstructibility of an NDS with descriptor subsystems (Q2151868) (← links)
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
• The \(b\)-branching problem in digraphs (Q2192110) (← links)
• Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs (Q2220346) (← links)
• A module-theoretic approach to matroids (Q2318422) (← links)
• Decomposition theorems for square-free 2-matchings in bipartite graphs (Q2410265) (← links)
• Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs (Q2827824) (← links)
• A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
• Computing Weighted Strength and Applications to Partitioning (Q4558887) (← links)
• Tropical ideals (Q4636422) (← links)
• Popular Matchings with Ties and Matroid Constraints (Q5351863) (← links)
• Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems (Q5866449) (← links)
• CONTROLLABILITY ANALYSIS OF COMPLEX NETWORKS USING STATISTICAL RANDOM SAMPLING (Q6122179) (← links)
• Pure Nash equilibria in weighted matroid congestion games with non-additive aggregation and beyond (Q6657230) (← links)
• Computing valuations of the Dieudonné determinants (Q6666553) (← links)