Pages that link to "Item:Q2091799"
From MaRDI portal
The following pages link to Revising Johnson's table for the 21st century (Q2091799):
Displaying 5 items.
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- MaxCut on permutation graphs is NP‐complete (Q6047965) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
