Pages that link to "Item:Q3439140"
From MaRDI portal
The following pages link to Minimum Dominating Trail Set for Two-Terminal Series Parallel Graphs (Q3439140):
Displaying 3 items.
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- A bi-objective coordination setup problem in a two-stage production system (Q2482750) (← links)