Pages that link to "Item:Q972335"
From MaRDI portal
The following pages link to Characterizing and computing minimal cograph completions (Q972335):
Displaying 7 items.
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Efficient enumeration of maximal split subgraphs and induced sub-cographs and related classes (Q6145807) (← links)
