The following pages link to Fabien de Montgolfier (Q486992):
Displaying 17 items.
- Computing \(H\)-joins with application to 2-modular decomposition (Q486993) (← links)
- Decomposing a graph into shortest paths with bounded eccentricity (Q777405) (← links)
- A tie-break model for graph search (Q896657) (← links)
- Algorithmic aspects of switch cographs (Q906430) (← links)
- A note on computing set overlap classes (Q975443) (← links)
- Linear-time modular decomposition of directed graphs (Q1764805) (← links)
- On the minimum eccentricity isometric cycle problem (Q2132344) (← links)
- A general algorithmic scheme for modular decompositions of hypergraphs and applications (Q2301749) (← links)
- A general algorithmic scheme for combinatorial decompositions with application to modular decompositions of hypergraphs (Q2672614) (← links)
- Algorithms for Some H-Join Decompositions (Q2894487) (← links)
- Linear Time Split Decomposition Revisited (Q2910928) (← links)
- Minimum Eccentricity Shortest Path Problem: An Approximation Algorithm and Relation with the k-Laminarity Problem (Q2958315) (← links)
- Asymptotic Modularity of Some Graph Classes (Q3104638) (← links)
- Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs (Q3394985) (← links)
- The bi-join decomposition (Q3439330) (← links)
- On Modular Decomposition Concepts: the case for Homogeneous Relations (Q3439506) (← links)
- (Q5136231) (← links)
