An algorithm for finding a short closed spanning walk in a graph

DOI10.1002/net.3230100306zbMath0443.05057OpenAlexW1991193145MaRDI QIDQ3885792

K. Takamizawa, Nobuji Saito, Takao Nishizeki

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100306

zbMATH Keywords

polynomially bounded algorithmclosed spanning walk

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ Dynamic graph-based search in unknown environments

This page was built for publication: An algorithm for finding a short closed spanning walk in a graph