Pages that link to "Item:Q690461"
From MaRDI portal
The following pages link to Complexity and parameterized algorithms for cograph editing (Q690461):
Displaying 20 items.
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- On tree representations of relations and graphs: symbolic ultrametrics and cograph edge decompositions (Q721942) (← links)
- Spiders can be recognized by counting their legs (Q904532) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A polynomial kernel for trivially perfect editing (Q1799208) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
- Best match graphs and reconciliation of gene trees with species trees (Q2303745) (← links)
- Faster algorithms for cograph edge modification problems (Q2308466) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Complete characterization of incorrect orthology assignments in best match graphs (Q2659043) (← links)
- Complexity of modification problems for best match graphs (Q2661779) (← links)
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions (Q3196420) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs (Q6180640) (← links)
