Recommendations
- scientific article; zbMATH DE number 1305469
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- A fast algorithm to generate necklaces with fixed content
- Algorithms for Greechie diagrams
- AN ALGORITHM TO CONSTRUCT THE LE DIAGRAM ASSOCIATED TO A GRASSMANN NECKLACE
- Simplotopal maps and necklace splitting
- Necklaces and convex \(k\)-gons
- scientific article; zbMATH DE number 1263424
- scientific article; zbMATH DE number 1445312
Cites work
- A branch and bound to minimize the number of late jobs on a single machine with release time constraints
- A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
- Algorithmic aspects of proportional symbol maps
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Boundary labeling with octilinear leaders
- Boundary labeling: Models and efficient algorithms for rectangular maps
- Coloring a Family of Circular Arcs
- Finding the largest suborder of fixed width
- Minimizing late jobs in the general one machine scheduling problem
- Minimizing setups in ordered sets of fixed width
- Revisiting Tucker's Algorithm to Color Circular Arc Graphs
- Scheduling Unit–Time Tasks with Arbitrary Release Times and Deadlines
- The Complexity of Coloring Circular Arcs and Chords
Cited in
(8)- A fast algorithm to generate necklaces with fixed content
- Algorithmic aspects of proportional symbol maps
- Simplotopal maps and necklace splitting
- scientific article; zbMATH DE number 1305469 (Why is no real title available?)
- NECKLACE SWAP PROBLEM FOR RHYTHMIC SIMILARITY MEASURES
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- Necklaces, convolutions, and \(X+Y\)
- Algorithmic Aspects of Proportional Symbol Maps
This page was built for publication: Algorithms for Necklace Maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950591)
