Bipartite Domination and Simultaneous Matroid Covers
From MaRDI portal
Publication:4443106
DOI10.1137/S089548019828371XzbMath1029.05097MaRDI QIDQ4443106
No author found.
Publication date: 8 January 2004
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)
Related Items
On the computational complexity of the Helly number in the \(P_3\) and related convexities ⋮ Almost Induced Matching: Linear Kernels and Parameterized Algorithms ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Graphs with maximal induced matchings of the same size ⋮ Exact algorithms for maximum induced matching ⋮ On the parameterized complexity of the acyclic matching problem ⋮ Perfectly matched sets in graphs: parameterized and exact computation ⋮ Parameterized algorithms and kernels for almost induced matching ⋮ Induced matchings in intersection graphs. ⋮ Well-indumatched Trees and Graphs of Bounded Girth ⋮ Approximability results for the maximum and minimum maximal induced matching problems ⋮ Approximation hardness of dominating set problems in bounded degree graphs ⋮ On the approximability of the maximum induced matching problem ⋮ On distance-3 matchings and induced matchings ⋮ The complexity of dissociation set problems in graphs ⋮ Maximum induced matchings for chordal graphs in linear time ⋮ The parameterized complexity of the induced matching problem ⋮ On Distance-3 Matchings and Induced Matchings ⋮ Brambles and independent packings in chordal graphs ⋮ The graphs with maximum induced matching and maximum matching the same size ⋮ Independent packings in structured graphs ⋮ Moderately exponential time algorithms for the maximum induced matching problem
