Pages that link to "Item:Q5915591"

The following pages link to On the relation of strong triadic closure and cluster deletion (Q5915591):

Displaying 12 items.

• Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
• (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
• Parameterized aspects of strong subgraph closure (Q2182097) (← links)
• A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
• FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
• Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
• (Q5092370) (← links)
• Learning Bayesian Networks Under Sparsity Constraints: A Parameterized Complexity Analysis (Q5094064) (← links)
• On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
• Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
• (Q5919461) (redirect page) (← links)
• A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)