Königsberg sightseeing: Eulerian walks in temporal graphs

DOI10.1007/978-3-030-79987-8_34MaRDI QIDQ2115887zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 22 March 2022

Full work available at URL https://arxiv.org/abs/2103.07522

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 3871422 (Why is no real title available?)
• scientific article; zbMATH DE number 3231691 (Why is no real title available?)
• A time-dependent hierarchical Chinese postman problem
• An introduction to temporal graphs: an algorithmic perspective
• Connectivity and inference problems for temporal networks
• Covering a graph with nontrivial vertex-disjoint paths: existence and optimization
• Decomposition of graphs into paths and cycles
• Enumerating maximal cliques in link streams with durations
• Faster exploration of degree-bounded temporal graphs
• Non-strict Temporal Exploration
• Parameterized complexity of Eulerian deletion problems
• The Complexity of Multiterminal Cuts
• The Planar Hamiltonian Circuit Problem is NP-Complete
• The temporal explorer who returns to the base
• Time-constrained Chinese postman problems
• Traveling salesman problems in temporal graphs

Cited in

(9)

• Exact and approximation algorithms for covering timeline in temporal graphs
• Untangling temporal graphs of bounded degree
• Timeline cover in temporal graphs: exact and approximation algorithms
• Finding colorful paths in temporal graphs
• Edge exploration of temporal graphs
• Exploiting automorphisms of temporal graphs for fast exploration and rendezvous
• Eulerian walks in temporal graphs
• An FPT algorithm for temporal graph untangling
• An FPT algorithm for timeline cover

This page was built for publication: Königsberg sightseeing: Eulerian walks in temporal graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115887)