Special Type Routing Problems in Plane Graphs
We considered routing problems for plane graphs to solve control problems of cutting machines in the industry. According to the cutting plan, we form its homeomorphic image in the form of a plane graph <i>G</i>. We determine the appropriate type of route for the given graph: <inline-f...
Main Authors: | Tatiana Makarovskikh, Anatoly Panyukov |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2022-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/10/5/795 |
Similar Items
-
Detouring Skip Graph: Efficient Routing via Detour Routes on Skip Graph Topology
by: Takeshi Kaneko, et al.
Published: (2020-01-01) -
Minimal unavoidable sets of cycles in plane graphs
by: Tomáš Madaras, et al.
Published: (2018-01-01) -
A Note On Vertex Colorings Of Plane Graphs
by: Fabricia Igor, et al.
Published: (2014-11-01) -
Interlace polynomials of lollipop and tadpole graphs
by: Christina L Eubanks-Turner, et al.
Published: (2022-03-01) -
Interlace polynomials of friendship graphs
by: Christina Eubanks-Turner, et al.
Published: (2018-10-01)