Gaétan Richad on Muck Rack

Gaétan Richad

Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Gaétan

Contact Gaétan, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

[2305.07271] Complexity of conjunctive regular path query homomorphisms

|
By Florent Foucaud, Florent R. Madelaine, Lhouari Nourine, Gaétan Richad
| arxiv.org
A graph database is a digraph whose arcs are labeled with symbols from a fixed alphabet. A regular graph pattern (RGP) is a digraph whose edges are labeled with regular expressions over the alphabet. RGPs model navigational queries for graph databases called conjunctive regular path queries (CRPQs).
Open in Who Shared Issue with article?
See all 1 articles
 •  Privacy  •  Terms  •  Security and Legal  •   •   •   • 

© 2026 Muck Rack

SOC 2® Certified