Pages that link to "Item:Q2875683"
From MaRDI portal
The following pages link to Algorithms on subgraph overlap graphs (Q2875683):
Displaying 7 items.
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- Algorithmic Aspects of the Intersection and Overlap Numbers of a Graph (Q4909563) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)