The following pages link to Guillaume Fertin (Q214959):
Displaying 4 items.
- Upper and lower bounds for finding connected motifs in vertex-colored graphs (Q716314) (← links)
- Optimal odd gossiping (Q1671312) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← links)
- Permutation pattern matching for doubly partially ordered patterns (Q6496850) (← links)
