Pages that link to "Item:Q394219"
From MaRDI portal
The following pages link to The cluster deletion problem for cographs (Q394219):
Displaying 12 items.
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats (Q2172401) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
- A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs (Q2345859) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- (Q5092370) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
