Pages that link to "Item:Q294733"
From MaRDI portal
The following pages link to Maximum weight independent sets and cliques in intersection graphs of filaments (Q294733):
Displayed 10 items.
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Maximum independent set and maximum clique algorithms for overlap graphs (Q1408815) (← links)
- Induced matchings in intersection graphs. (Q1427466) (← links)
- Algorithms for maximum weight induced paths (Q1603504) (← links)
- Finding a maximum induced matching in weakly chordal graphs (Q1810638) (← links)
- 3D-interval-filament graphs (Q2462403) (← links)
- Approximating the minimum clique cover and other hard problems in subtree filament graphs (Q2506362) (← links)
- The graphs with maximum induced matching and maximum matching the same size (Q2568473) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Recognition of Polygon-Circle Graphs and Graphs of Interval Filaments Is NP-Complete (Q3508571) (← links)