Cover Image

Monitoring the edges of product networks using distances

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Wen, Klasing, Ralf, Mao, Yaping, Ning, Bo
Format:	Preprint
Published:	2022
Subjects:	Discrete Mathematics Networking and Internet Architecture Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Perturbation results for distance-edge-monitoring numbers
by: Yang, Chenxu, et al.
Published: (2023)

The $g$-good-neighbor diagnosability of product networks under the PMC model
by: Wang, Zhao, et al.
Published: (2025)

A decomposition approach for large virtual network embedding
by: Benhamiche, Amal, et al.
Published: (2025)

Alternative paths computation for congestion mitigation in segment-routing networks
by: Martin, Sébastien, et al.
Published: (2024)

Anonymized Network Sensing Graph Challenge
by: Jananthan, Hayden, et al.
Published: (2024)

Complexity of the Virtual Network Embedding with uniform demands
by: Benhamiche, Amal, et al.
Published: (2025)

Fast Reroute with Highly Connected Routes Based on Maximum Flow Evaluation
by: Okida, Leon, et al.
Published: (2024)

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation
by: Brunelli, Filippo, et al.
Published: (2021)

A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
by: Bentert, Matthias, et al.
Published: (2026)

Reconfigurable routing in data center networks
by: Kutner, David C., et al.
Published: (2024)

On the Multi-Commodity Flow with convex objective function: Column-Generation approaches
by: Beraud-Sudreau, Guillaume, et al.
Published: (2026)

Improving the Graph Challenge Reference Implementation
by: Voloshchuk, Inna, et al.
Published: (2026)

Instability of backoff protocols with arbitrary arrival rates
by: Goldberg, Leslie Ann, et al.
Published: (2022)

Quantum Hilbert Transform
by: Jha, Nitin, et al.
Published: (2025)

Dismountability in Temporal Cliques Revisited
by: Carnevale, Daniele, et al.
Published: (2025)

Combinatorics of nondeterministic walks
by: de Panafieu, Élie, et al.
Published: (2023)

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems
by: Ganesan, Ashwin
Published: (2022)

Optimizing LoRa for Edge Computing with TinyML Pipeline for Channel Hopping
by: Grunewald, Marla, et al.
Published: (2024)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
by: Dragan, Feodor F., et al.
Published: (2018)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
by: Chakraborty, Dibyayan, et al.
Published: (2024)

The Instability of all Backoff Protocols
by: Goldberg, Leslie Ann, et al.
Published: (2026)

On multiplicities of interpoint distances
by: Clemen, Felix Christian, et al.
Published: (2025)

A note on distance-hereditary graphs whose complement is also distance-hereditary
by: Jacob, Hugo
Published: (2025)

On the edge expansion of random polytopes
by: Ferber, Asaf, et al.
Published: (2025)

Isomorphisms of unit distance graphs of layers
by: Bikeev, Arthur Igorevich
Published: (2025)

Elimination distance to bounded degree on planar graphs
by: Lindermayr, Alexander, et al.
Published: (2020)

Restricted subgraphs of edge-colored graphs and applications
by: Sudakov, Benny
Published: (2024)

Multigraph edge-coloring with local list sizes
by: Dhawan, Abhishek
Published: (2023)

Vertex-edge domination on subclasses of bipartite graphs
by: Pandey, Arti, et al.
Published: (2025)

On the expressive power of $2$-edge-colourings of graphs
by: Bok, Jan, et al.
Published: (2025)

Neighbour sum distinguishing edge-weightings with local constraints
by: Dailly, Antoine, et al.
Published: (2022)

A hierarchy of edge-weight symmetries in perfect matchings
by: Bérczi, Kristóf, et al.
Published: (2026)

A note on the distinct distances problem over finite fields
by: Brukhim, Nataly, et al.
Published: (2025)

Separating the edges of a graph by cycles and by subdivisions of $K_4$
by: Botler, Fábio, et al.
Published: (2024)

Filling some gaps on the edge coloring problem of split graphs
by: Couto, Fernanda, et al.
Published: (2024)

A verified implementation of the Misra and Gries edge coloring algorithm
by: Bhoja, Arohee
Published: (2025)

Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
by: Foucaud, Florent, et al.
Published: (2024)

Upper bounds on the average edit distance between two random strings
by: Rosenfeld, Matthieu
Published: (2024)

A Vizing-like theorem for union vertex-distinguishing edge coloring
by: Bousquet, Nicolas, et al.
Published: (2016)

2-distance 4-coloring of planar subcubic graphs with girth at least 21
by: La, Hoang, et al.
Published: (2021)