Work

NP-Completeness of the Eulerian Walk Problem for a Multiple Graph

Year: 2024

Type: article

Source: Automatic Control and Computer Sciences

DOI: 10.3103/s0146411624700470

Author: A. V. Smirnov

Institution: Yaroslavl State University

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W4407402586

FWCI: 0.201

Cites: 10

Cited by: 1

Related to: 10