Bipartite Domination and Simultaneous Matroid Covers
From MaRDI portal
Publication:4443106
Recommendations
- Domination in convex and chordal bipartite graphs
- Domination in some subclasses of bipartite graphs
- Simultaneously dominating all spanning trees of a graph
- Domination in some subclasses of bipartite graphs
- A linear time algorithm for computing a minimum paired-dominating set of a convex bipartite graph
Cited in
(32)- The complexity of dissociation set problems in graphs
- Exact algorithms for maximum induced matching
- Brambles and independent packings in chordal graphs
- On the parameterized complexity of the acyclic matching problem
- Well-indumatched Trees and Graphs of Bounded Girth
- Parameterized results on acyclic matchings with implications for related problems
- Well-indumatched pseudoforests
- Computational complexity and linear formulations for optimizing the location of shared mobility stations
- Approximation hardness of dominating set problems in bounded degree graphs
- On the approximability of the maximum induced matching problem
- Approximability results for the maximum and minimum maximal induced matching problems
- Parameterized algorithms and kernels for almost induced matching
- A bisection approach to subcubic maximum induced matching
- Induced matchings in intersection graphs.
- Simultaneously dominating all spanning trees of a graph
- Edge open packing: complexity, algorithmic aspects, and bounds
- The parameterized complexity of the induced matching problem
- Almost induced matching: linear kernels and parameterized algorithms
- On distance-3 matchings and induced matchings
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs of bounded treewidth
- Solving the problem of finding an independent \(\{K_1,K_2\}\)-packing of maximum weight on graphs with special blocks
- An improved kernel and parameterized algorithm for almost induced matching
- Perfectly matched sets in graphs: parameterized and exact computation
- The graphs with maximum induced matching and maximum matching the same size
- On the computational complexity of the Helly number in the \(P_3\) and related convexities
- Independent packings in structured graphs
- On distance-3 matchings and induced matchings
- Maximum induced matchings for chordal graphs in linear time
- Moderately exponential time algorithms for the maximum induced matching problem
- Graphs with maximal induced matchings of the same size
- Covering intersecting bi-set families under matroid constraints
This page was built for publication: Bipartite Domination and Simultaneous Matroid Covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4443106)
