2 citations · 2 across the 2 of their papers we have counts for
1 paper · 1 filter
James Trimble
We present exact and heuristic algorithms that find, for a given family of graphs, a graph that contains each member of the family as an induced subgraph. For 0≤k≤6, we…