Chain sequences with ordered enclosing

DOI10.1134/S1064230707010108zbMATH Open1272.93087MaRDI QIDQ367978FDOQ367978

Authors: T. A. Panyukova 

Publication date: 17 September 2013

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Application models in control theory (93C95) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Eulerian graphs and related topics. Part 1, Volume 2
• Title not available (Why is that?)

Cited In (6)

• 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
• Construction of a technologically feasible cutting with pierce points placement constraints

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)