The following pages link to Christophe Crespelle (Q243612):
Displaying 10 items.
- Linearity is strictly more powerful than contiguity for encoding graphs (Q284761) (← links)
- An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem (Q391090) (← links)
- (Nearly-)tight bounds on the contiguity and linearity of cographs (Q393888) (← links)
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- Unrestricted and complete breadth-first search of trapezoid graphs in \(O(n)\) time (Q763538) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Cyclability in graph classes (Q833007) (← links)
- Fully dynamic representations of interval graphs (Q1711837) (← links)
- An \(O(n^2)\) time algorithm for the minimal permutation completion problem (Q1720313) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
