Königsberg sightseeing: Eulerian walks in temporal graphs
type: Item
instance of: scholarly article
title: Königsberg sightseeing: Eulerian walks in temporal graphs
DOI: 10.1007/978-3-030-79987-8_34
author: Yanyan Li
publication date: 2022-03-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/2103.07522
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495043
MaRDI profile type: Publication
OpenAlex ID: W3182275057
cites work: The temporal explorer who returns to the base
cites work: Decomposition of graphs into paths and cycles
cites work: A time-dependent hierarchical Chinese postman problem
cites work: Parameterized complexity of Eulerian deletion problems
cites work: The Complexity of Multiterminal Cuts
cites work: On temporal graph exploration
cites work: Q5005137
cites work: Non-strict Temporal Exploration
cites work: Long Circuits and Large Euler Subgraphs
cites work: The Planar Hamiltonian Circuit Problem is NP-Complete
cites work: Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
cites work: Q5519709
cites work: Connectivity and inference problems for temporal networks
cites work: Enumerating maximal cliques in link streams with durations
cites work: An Introduction to Temporal Graphs: An Algorithmic Perspective*
cites work: Traveling salesman problems in temporal graphs
cites work: Q3338297
cites work: Time-constrained Chinese postman problems
description: scientific article; zbMATH DE number 7495043