Realizing temporal transportation trees

DOI10.1007/978-3-032-11835-6_28MaRDI QIDQ7294445zbMATH OpenFDO

Authors George B. Mertzios, Hendrik Molter, Nils Morawietz, P. G. Spirakis

Publication date 10 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-11835-6_28

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A cop and robber game on edge-periodic temporal graphs
• A fast algorithm for constructing trees from distance matrices
• A game of cops and robbers on graphs with periodic edge-connectivity
• An Almost Linear-Time Algorithm for Graph Realization
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Composed degree-distance realizations of graphs
• Connectivity and inference problems for temporal networks
• Distance matrix of a graph and its realizability
• Distance realization problems with applications to internet tomography
• Eccentric sequences and eccentric sets in graphs
• Eccentric sequences in graphs
• Efficiently realizing interval sequences
• Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
• Graph editing to a given degree sequence
• Graph realization of distance sets
• Graph realizations: maximum degree in vertex neighborhoods
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 2117210 (Why is no real title available?)
• scientific article; zbMATH DE number 2119749 (Why is no real title available?)
• scientific article; zbMATH DE number 795223 (Why is no real title available?)
• scientific article; zbMATH DE number 7559442 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Linear-time certifying algorithms for near-graphical sequences
• Multi-parameter analysis of finding minors and subgraphs in edge-periodic temporal graphs
• Multi-Terminal Network Flows
• On probe interval graphs
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the realization of a (p,s)-digraph with prescribed degrees
• Temporal network theory
• The distance matrix of a graph and its tree realization
• Weighted graphs with distances in given ranges
• Zero-one matrices with zero trace

This page was built for publication: Realizing temporal transportation trees

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