The following pages link to Editing Simple Graphs (Q2938751):
Displaying 7 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
