Pages that link to "Item:Q2051847"
From MaRDI portal
The following pages link to On the threshold of intractability (Q2051847):
Displaying 17 items.
- Rank reduction of oriented graphs by vertex and edge deletions (Q722520) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- Paths to trees and cacti (Q1998842) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379) (← links)
- Simultaneous consecutive ones submatrix and editing problems: classical complexity and fixed-parameter tractable results (Q2297848) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- Fast Quasi-Threshold Editing (Q3452790) (← links)
- (Q3452804) (redirect page) (← links)
- Central Positions in Social Networks (Q5042225) (← links)
- (Q5075776) (← links)
- Paths to Trees and Cacti (Q5283353) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5918994) (← links)
- On the Parameterized Approximability of Contraction to Classes of Chordal Graphs (Q6084414) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
