Computing inductive vertex orderings
From MaRDI portal
Recommendations
Cites work
- Approximation algorithms for intersection graphs
- Approximation algorithms for maximum independent set of pseudo-disks
- Clique is hard to approximate within \(n^{1-\epsilon}\)
- Elimination graphs
- Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On the Shannon capacity of a graph
- Scheduling Split Intervals
- Simple heuristics for unit disk graphs
- Smallest-last ordering and clustering and graph coloring algorithms
- The sandwich theorem
- Universal framework for wireless scheduling problems
Cited in
(3)
This page was built for publication: Computing inductive vertex orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234785)