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

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

Latest revision as of 02:37, 29 June 2024

scientific article
Language Label Description Also known as
English
Mutual exclusion scheduling with interval graphs or related classes. I
scientific article

    Statements

    Mutual exclusion scheduling with interval graphs or related classes. I (English)
    0 references
    0 references
    4 March 2009
    0 references
    chromatic scheduling
    0 references
    bounded coloring
    0 references
    workforce planning
    0 references
    interval graphs
    0 references
    graph algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers