Pages that link to "Item:Q3655136"
From MaRDI portal
The following pages link to Algorithms on Subtree Filament Graphs (Q3655136):
Displaying 9 items.
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Trees with the mos subtrees - an algorithmic approach (Q1937356) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Algorithms on subgraph overlap graphs (Q2875683) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- Subsumption algorithms based on search trees (Q5878906) (← links)
- Maximum max-k-clique subgraphs in cactus subtree graphs (Q6132893) (← links)