The following pages link to Christophe Crespelle (Q243612):
Displaying 30 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)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Fully dynamic recognition algorithm and certificate for directed cographs (Q2499593) (← links)
- Termination of the iterated strong-factor operator on multipartite graphs (Q2512660) (← links)
- Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time (Q2515582) (← links)
- Completion to chordal distance-hereditary graphs: a quartic vertex-kernel (Q2672433) (← links)
- An $$\mathcal {O}(n^2)$$ Time Algorithm for the Minimal Permutation Completion Problem (Q2827805) (← links)
- Termination of Multipartite Graph Series Arising from Complex Network Modelling (Q3066139) (← links)
- Linearity Is Strictly More Powerful Than Contiguity for Encoding Graphs (Q3449818) (← links)
- An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem (Q3569074) (← links)
- Efficient Neighborhood Encoding for Interval Graphs and Permutation Graphs and O(n) Breadth-First Search (Q3651542) (← links)
- Linear-Time Constant-Ratio Approximation Algorithm and Tight Bounds for the Contiguity of Cographs (Q4914441) (← links)
- A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product (Q4925263) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710825) (← links)
- Fully Dynamic Representations of Interval Graphs (Q5851095) (← links)
- (Q5875577) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897542) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Fully dynamic algorithm for recognition and modular decomposition of permutation graphs (Q5961976) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- A quasi-quadratic vertex-kernel for cograph edge editing (Q6611028) (← links)
- Dividing permutations in the semiring of functional digraphs (Q6637840) (← links)
