Pages that link to "Item:Q3075510"
From MaRDI portal
The following pages link to On Making a Distinguished Vertex Minimum Degree by Vertex Deletion (Q3075510):
Displaying 4 items.
- On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion (Q491619) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- On bounded-degree vertex deletion parameterized by treewidth (Q765338) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
