scientific article; zbMATH DE number 6515828
From MaRDI portal
Publication:3455036
Recommendations
- Reducing rank of the adjacency matrix by graph modification
- A Reduction of Algebraic Representations of Matroids
- Enumerating matroids of fixed rank
- A generalization of the notion of the rank function of a matroid
- Matrix reduction in a combinatorial computation
- Rank on poset matroids
- On reduced matrices
- Rank Reducing Matrix Norms
- On Rédei matrices with minimal rank
Cited in
(18)- Blocking unions of arborescences
- Blocking optimal structures
- The complexity of mixed-connectivity
- The maximum vertex coverage problem on bipartite graphs
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
- Computing densest \(k\)-subgraph with structural parameters
- Rank reduction of directed graphs by vertex and edge deletions
- Interdicting structured combinatorial optimization problems with {0,1}-objectives
- Decreasing the Displacement Rank of a Matrix
- Covering Vectors by Spaces: Regular Matroids
- Symmetric interdiction for matching problems
- Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
- On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
- Partial vertex cover and budgeted maximum coverage in bipartite graphs
- Parametric matroid interdiction
- On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
- The parametric matroid -interdiction problem
- Interdiction of minimum spanning trees and other matroid bases
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3455036)
