Pages that link to "Item:Q5060771"
From MaRDI portal
The following pages link to Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph (Q5060771):
Displaying 5 items.
- On the complexity of ``Superdetermined'' minrank instances (Q2302132) (← links)
- Complexity aspects of the computation of the rank of a graph (Q2928582) (← links)
- On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis (Q3476831) (← links)
- The Evolution of the Minimum Degree Ordering Algorithm (Q3823722) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)