The following pages link to 3D-interval-filament graphs (Q2462403):
Displaying 12 items.
- Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733) (← links)
- On the structure of certain intersection graphs (Q845675) (← links)
- Algorithms for \(\mathcal{GA}\mathrm{-}\mathcal H\) reduced graphs (Q891818) (← links)
- Minimum weight feedback vertex sets in circle graphs (Q963384) (← links)
- Algorithms for induced biclique optimization problems (Q1944925) (← links)
- New insights on \(\mathbf{GA}\)-\(\mathbf H\) reduced graphs (Q2404619) (← links)
- Maximum weight induced multicliques and complete multipartite subgraphs in directed path overlap graphs (Q2788740) (← links)
- Minimum weight feedback vertex sets in circle \(n\)-gon graphs and circle trapezoid graphs (Q2890989) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)
- Algorithms on Subtree Filament Graphs (Q3655136) (← links)
- Approximation algorithms for maximum weight <i>k</i>-coverings of graphs by packings (Q5063275) (← links)
- A faster algorithm for maximum independent set on interval filament graphs (Q5084714) (← links)
