Pages that link to "Item:Q672265"
From MaRDI portal
The following pages link to Edge domination on bipartite permutation graphs and cotriangulated graphs (Q672265):
Displaying 23 items.
- Linear-time algorithm for the paired-domination problem in convex bipartite graphs (Q692884) (← links)
- Acyclic domination on bipartite permutation graphs (Q845701) (← links)
- The rook problem on saw-toothed chessboards (Q847376) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- A 2-approximation algorithm for the minimum weight edge dominating set problem (Q1602689) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Linear-time algorithms for counting independent sets in bipartite permutation graphs (Q1675914) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Complexity and characterization aspects of edge-related domination for graphs (Q2023127) (← links)
- On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem (Q2085737) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Grundy coloring in some subclasses of bipartite graphs and their complements (Q2203596) (← links)
- Approximation hardness of edge dominating set problems (Q2369972) (← links)
- Approximability of the capacitated \(b\)-edge dominating set problem (Q2456372) (← links)
- Generalizing the induced matching by edge capacity constraints (Q2467130) (← links)
- Linear time algorithms for generalized edge dominating set problems (Q2480902) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Decomposition algorithms for solving the minimum weight maximal matching problem (Q2811314) (← links)
- Maximal matching polytope in trees (Q2815540) (← links)
- Hardness and approximation of minimum maximal matchings (Q2935383) (← links)
- Minimum Maximal Matching Is NP-Hard in Regular Bipartite Graphs (Q3502661) (← links)
- A $(2 - c \frac{\log {n}}{n})$ Approximation Algorithm for the Minimum Maximal Matching Problem (Q3602847) (← links)