Recommendations
- By-passes with ordered enclosing in planar graphs
- Constructing of \(OE\)-postman path for a planar graph
- The algorithms for constructing of cutter optimal path
- scientific article; zbMATH DE number 6007896
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
Cites work
Cited in
(6)- Construction of a technologically feasible cutting with pierce points placement constraints
- Sequential order under CH
- By-passes with ordered enclosing in planar graphs
- Mathematical models and routing algorithms for CAD technological preparation of cutting processes
- The estimation of the number of OE-chains and realizable OE-routes for cutting plans with combined contours
- Antichain sequences
This page was built for publication: Chain sequences with ordered enclosing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q367978)