Vertex ordering with precedence constraints
From MaRDI portal
Publication:6546603
DOI10.1007/978-3-031-43587-4_22MaRDI QIDQ6546603
Arash Rafiey, Mohammad Sorkhpar, Jeff Kinne, Akbar Rafiey
Publication date: 29 May 2024
Cites Work
- List H-coloring a graph by removing few vertices
- The complexity of the list homomorphism problem for graphs
- On the complexity of scheduling unit-time jobs with or-precedence constraints
- Bipartite permutation graphs
- Bi-complement reducible graphs
- On the approximability of average completion time scheduling under precedence constraints.
- Scheduling unit-length jobs with precedence constraints of small height
- Parallel machine scheduling with nested job assignment restrictions
- A dichotomy for minimum cost graph homomorphisms
- On the Approximability of Single-Machine Scheduling with Precedence Constraints
- Restricted Max-Min Fair Allocations with Inclusion-Free Intervals
- NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
- Barrier heights between ground states in a model of RNA secondary structure
- Scheduling with AND/OR Precedence Constraints
This page was built for publication: Vertex ordering with precedence constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6546603)
