Restrictions of graph partition problems. I
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Linear Recognition Algorithm for Cographs
- Efficient algorithms for interval graphs and circular-arc graphs
- On a property of the class of n-colorable graphs
- Processor optimization for flow graphs
- Scheduling Interval-Ordered Tasks
- The NP-completeness column: an ongoing guide
Cited in
(41)- Asynchronous coordination under preferences and constraints
- A polynomial characterization of some graph partitioning problems
- Transfer flow graphs
- Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph
- Structural parameterizations for equitable coloring: complexity, FPT algorithms, and kernelization
- Batch processing with interval graph compatibilities between tasks
- “Rent-or-Buy” Scheduling and Cost Coloring Problems
- Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
- Some approximation algorithms for the clique partition problem in weighted interval graphs
- Gap one bounds for the equitable chromatic number of block graphs
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Scheduling jobs on identical machines with agreement graph
- Mutual exclusion scheduling with interval graphs or related classes. II
- Locally boundedk-colorings of trees
- New results in two identical machines scheduling with agreement graphs
- An efficiently solvable graph partition problem to which many problems are reducible
- On partitioning interval graphs into proper interval subgraphs and related problems
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Scheduling with conflicts: Online and offline algorithms
- Scheduling identical jobs on uniform machines with a conflict graph
- Clique partitioning with value-monotone submodular cost
- On the thinness and proper thinness of a graph
- A hybrid metaheuristic for the two-dimensional strip packing problem
- LATIN 2004: Theoretical Informatics
- Complexity of graph partition problems
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees
- scientific article; zbMATH DE number 219236 (Why is no real title available?)
- Scheduling with machine conflicts
- Complexity and approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- An improved algorithm for parallel machine scheduling under additional resource constraints
- Equitable colorings of bounded treewidth graphs
- Window-based greedy contention management for transactional memory: theory and practice
- Mutual exclusion scheduling
- Scheduling: agreement graph vs resource constraints
- Mutual exclusion scheduling with interval graphs or related classes. I
- Bounded max-colorings of graphs
- Capacitated max-batching with interval graph compatibilities
- On clique partitions of split graphs
- Approximation algorithms for two parallel dedicated machine scheduling with conflict constraints
- Scheduling on uniform machines with a conflict graph: complexity and resolution
- A competitive analysis for balanced transactional memory workloads
This page was built for publication: Restrictions of graph partition problems. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672380)
