2 citations · 8 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2016★ 1 cited
Finding long simple paths in a weighted digraph using pseudo-topological orderings
Miguel Raggi
Given a weighted digraph D, finding the longest simple path is well known to be NP-hard. Furthermore, even giving an approximation algorithm is known to be NP-hard. In this paper w…
cs.DM2012
Forbidden Configurations: Finding the number predicted by the Anstee-Sali Conjecture is NP-hard
Miguel Raggi
Let F be a hypergraph and let forb(m,F) denote the maximum number of edges a hypergraph with m vertices can have if it doesn't contain F as a subhypergraph. A conjecture of Anstee…