A tutorial on the use of graph coloring for some problems in robotics (Q948648): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Master-slave strategy and polynomial approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of bounds for classical Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a multiconstrained model for chromatic scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning cographs into cliques and stable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p,k)\)-coloring problems in line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximation of Min Split-coloring and Min Cocoloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On split-coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum cocolorings. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cocolourings and cochromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4182796 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning permutations into increasing and decreasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for a Loading Problem with Bounded Clique Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimum k-Modal Partitions of Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing a set of points into chains, with applications to permutation and circle graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3681937 / rank
 
Normal rank

Latest revision as of 17:28, 28 June 2024

scientific article
Language Label Description Also known as
English
A tutorial on the use of graph coloring for some problems in robotics
scientific article

    Statements

    A tutorial on the use of graph coloring for some problems in robotics (English)
    0 references
    0 references
    0 references
    0 references
    17 October 2008
    0 references
    pick up robots
    0 references
    AGV
    0 references
    automated storage system
    0 references
    pallet loading problem
    0 references
    \(l\)-modal sequence
    0 references
    generalized vertex coloring
    0 references
    permutation graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references