Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.04.016
+Normal rank
@@ Property / OpenAlex ID @@
+W2043493954
@@ Property / OpenAlex ID: W2043493954 / rank @@
+Normal rank
@@ Property / cites work @@
+Parallel algorithms for maximum matching in complements of interval graphs and related problems
+Normal rank
@@ Property / cites work @@
+Mutual exclusion scheduling
@@ Property / cites work: Mutual exclusion scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
+Normal rank
@@ Property / cites work @@
+Q2735585
@@ Property / cites work: Q2735585 / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical Foundations of Computer Science 2004
@@ Property / cites work: Mathematical Foundations of Computer Science 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+Restrictions of graph partition problems. I
@@ Property / cites work: Restrictions of graph partition problems. I / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+NP-completeness of graph decomposition problems
@@ Property / cites work: NP-completeness of graph decomposition problems / rank @@
+Normal rank
@@ Property / cites work @@
+Simple linear time recognition of unit interval graphs
+Normal rank
@@ Property / cites work @@
+Matching and multidimensional matching in chordal and strongly chordal graphs
+Normal rank
@@ Property / cites work @@
+Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Interval graphs and interval orders
@@ Property / cites work: Interval graphs and interval orders / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Coloring Circular Arcs and Chords
+Normal rank
@@ Property / cites work @@
+Q4452099
@@ Property / cites work: Q4452099 / rank @@
+Normal rank
@@ Property / cites work @@
+Mutual exclusion scheduling with interval graphs or related classes: complexity and algorithms
+Normal rank
@@ Property / cites work @@
+Maximum matching in a convex bipartite graph
@@ Property / cites work: Maximum matching in a convex bipartite graph / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum skew-symmetric flows
@@ Property / cites work: Maximum skew-symmetric flows / rank @@
+Normal rank
@@ Property / cites work @@
+Q3328583
@@ Property / cites work: Q3328583 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4808719
@@ Property / cites work: Q4808719 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4828541
@@ Property / cites work: Q4828541 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for interval graphs and circular-arc graphs
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank
@@ Property / cites work @@
+Scheduling with constrained processor allocation for interval orders
+Normal rank
@@ Property / cites work @@
+The mutual exclusion scheduling problem for permutation and comparability graphs.
+Normal rank
@@ Property / cites work @@
+Bounded vertex coloring of trees
@@ Property / cites work: Bounded vertex coloring of trees / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Chromatic optimisation: Limitations, objectives, uses, references
+Normal rank
@@ Property / cites work @@
+Circular convex bipartite graphs: Maximum matching and Hamiltonian circuits
+Normal rank
@@ Property / cites work @@
+Q4694722
@@ Property / cites work: Q4694722 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a Maximum Clique in a Set of Proper Circular Arcs in Time O(n) with Applications
+Normal rank
@@ Property / cites work @@
+Q4138414
@@ Property / cites work: Q4138414 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3898496
@@ Property / cites work: Q3898496 / rank @@
+Normal rank
@@ Property / cites work @@
+An \(0(n^{1.5})\) algorithm to color proper circular arcs
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for maximum matchings in convex, bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q3402439
@@ Property / cites work: Q3402439 / rank @@
+Normal rank
@@ Property / cites work @@
+Restricted coloring models for timetabling
@@ Property / cites work: Restricted coloring models for timetabling / rank @@
+Normal rank