Pages that link to "Item:Q3701460"
From MaRDI portal
The following pages link to Steiner trees, connected domination and strongly chordal graphs (Q3701460):
Displaying 10 items.
- On the computational difficulty of the terminal connection problem (Q6041044) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- On convexity in split graphs: complexity of Steiner tree and domination (Q6123388) (← links)
- Constrained Hitting Set and Steiner Tree in SCk and 2K2-free Graphs (Q6136471) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Open packing in \(H\)-free graphs and subclasses of split graphs (Q6547836) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)