21 citations · 21 across the 2 of their papers we have counts for
2 papers
cs.DS2019★ 21 cited
The Maximum Common Subgraph Problem: A Portfolio Approach
Andrea Marcelli, Stefano Quer, Giovanni Squillero
The Maximum Common Subgraph is a computationally challenging problem with countless practical applications. Even if it has been long proven NP-hard, its importance still motivates…
cs.DS2016
A Greedy Approach to Answer Reachability Queries on DAGs
Nicolas Boria, Gianpiero Cabodi, Paolo Camurati +3
Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been prese…