Results 21 to 30 of about 1,569,721 (239)

Eulerian Paths with Regular Constraints [PDF]

, 2016
Labeled graphs, in which edges are labeled by letters from some alphabet Sigma, are extensively used to model many types of relations associated with actions, costs, owners, or other properties.
Kupferman, Orna, Vardi, Gal
core   +5 more sources

A general implementation of Eulerian path [PDF]

, 2015
Implementation report of an Eulerian path function for general graphs.
S. R. Edwardo, Ortiz-Zuazaga Humberto
semanticscholar   +2 more sources

Improved Optimization Strategy Based on Region Division for Collaborative Multi-Agent Coverage Path Planning

Sensors, 2023
In this paper, we investigate the algorithms for traversal exploration and path coverage of target regions using multiple agents, enabling the efficient deployment of a set of agents to cover a complex region.
Yijie Qin, Lei Fu, Dingxin He, Zhiwei Liu   +3 more
doaj   +2 more sources

Implementation of Eulerian Paths based on the model of the Chinese postman: Application to the problems of garbage collection in the streets of the City of Kananga [PDF]

British journal of environmental sciences, 2023
Graph theory today plays a very important role in modeling and solving many problems. The complexity of this subject is considerable, especially since we must speak at the same time of the Chinese postman and the Eulerian journey. If it remains true that
Marie-Alice TSHIELA Nkuna
openalex   +2 more sources

Eulerian-Path-Decomposition In SuperHyperGraphs [PDF]

, 2023
[ADDRESSED CITATION] [HG160b] Henry Garrett, “Eulerian-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7820680). In this scientific research book, there are some scientific research chapters on “Extreme Eulerian-Path-Decomposition In SuperHyperGraphs ” and “Neutrosophic Eulerian-Path-Decomposition In ...
Henry Garrett
openalex   +2 more sources

Eulerian-Path-Neighbor In SuperHyperGraphs [PDF]

, 2023
[ADDRESSED CITATION] [HG161b] Henry Garrett, “Eulerian-Path-Neighbor In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7826705). In this scientific research book, there are some scientific research chapters on “Extreme Eulerian-Path-Neighbor In SuperHyperGraphs ” and “Neutrosophic Eulerian-Path-Neighbor In SuperHyperGraphs ” about some
Henry Garrett
openalex   +2 more sources

Eulerian-Path-Cut In SuperHyperGraphs [PDF]

, 2023
[ADDRESSED CITATION] [HG159b] Henry Garrett, “Eulerian-Path-Cut In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7812750). In this scientific research book, there are some scientific research chapters on “Extreme Eulerian-Path-Cut In SuperHyperGraphs ” and “Neutrosophic Eulerian-Path-Cut In SuperHyperGraphs ” about some scientific ...
Henry Garrett
openalex   +2 more sources

Eulerian disjoint paths problem in grid graphs is NP-complete

Discrete Applied Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dániel Marx
openalex   +3 more sources

A proof of some Schützenberger-type results for Eulerian paths and circuits on digraphs [PDF]

International Journal of Mathematics and Mathematical Sciences, 1993
This paper shows that the number of even Eulerian paths equals the number of odd Eulerian paths when the number of arcs is at least twice the number of vertices of a digraph.
Byoung-Song Chwe
openalex   +4 more sources

Eulerian-Type-Path-Decomposition In SuperHyperGraphs [PDF]

, 2023
“Book #163” [ADDRESSED CITATION] [HG163b] Henry Garrett, “Eulerian-Type-Path-Decomposition In SuperHyperGraphs”. Dr. Henry Garrett, 2023 (doi: 10.5281/zenodo.7848019). @googlebooks:https://books.google.com/books/about?id=- @GooglePlay:https://play.google.com/store/books/details?id=- @ResearchGate: https://www.researchgate.net/publication/- @WordPress:
Henry Garrett
openalex   +2 more sources