The Algorithms for the Eulerian Cycle and Eulerian Trail Problems for a Multiple Graph

In this article, we consider undirected multiple graphs of any natural multiplicity k > 1. A multiple graph contains edges of three types: ordinary edges, multiple edges, and multiedges. Each edge of the last two types is a union of k linked edges that connect 2 or ( k + 1) vertices, correspondin...

Celý popis

Podrobná bibliografia

Vydané v:	Automatic control and computer sciences Ročník 58; číslo 7; s. 889 - 903
Hlavný autor:	Smirnov, A. V.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Moscow Pleiades Publishing 01.12.2024 Springer Nature B.V
Predmet:	Algorithms Apexes Computer Science Control Structures and Microprogramming Graph theory Graphs Polynomials Eulerian cycle multiple path divisible graph covering trails reachability set multiple graph Eulerian trail graph with quasi-vertices
ISSN:	0146-4116, 1558-108X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!