Pages that link to "Item:Q1099085"
From MaRDI portal
The following pages link to Minimum-maximal matching in series-parallel graphs (Q1099085):
Displaying 14 items.
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Algorithms for recognition of regular properties and decomposition of recursive graph families (Q1179734) (← links)
- A graph approximation heuristic for the vertex cover problem on planar graphs (Q1328583) (← links)
- Integer programming formulations for the minimum weighted maximal matching problem (Q1758060) (← links)
- Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs (Q1899445) (← links)
- Minimum maximal matchings in cubic graphs (Q2144321) (← links)
- Modelling and solving the perfect edge domination problem (Q2174880) (← links)
- Maximal independent sets and maximal matchings in series-parallel and related graph classes (Q2288167) (← links)
- Maximum series-parallel subgraph (Q2429333) (← 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)
- (Q5005146) (← links)
- (Q5869351) (← links)