Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (0)
Journals and Conferences
Erlebach et al. define the notion of a trimmable class of graphs. This was motivated by a problem in map labelling. Roughly speaking, a class C of graphs is trimmable if, for each graphG ∈ C, it is… (More)