Network verification via routing table queries
type: Item
instance of: scholarly article
title: Network verification via routing table queries
zbMATH Open document ID: 1401.90052
author: Evangelos Bampas
author: D. Bilò
author: Guido Drovandi
author: Luciano Gualà
author: Ralf Klasing
author: Guido Proietti
published in: Journal of Computer and System Sciences
publication date: 2014-09-22T00:00:00Z
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6346985
zbMATH Keywords: network verification
zbMATH Keywords: graph/network topology
zbMATH Keywords: computational complexity
zbMATH Keywords: approximation algorithms
describes a project that uses: Algorithm 447
MaRDI profile type: Publication
full work available at URL: j.jcss.2014.06.003
OpenAlex ID: W1593732822
cites work: Discovery of network properties with all-shortest-paths queries
cites work: Reconstructing weighted graphs with minimal query complexity
cites work: Optimal query complexity bounds for finding graphs
cites work: Exploring networks with traceroute-like probes: Theory and simulations
cites work: Approximate Discovery of Random Graphs
cites work: Q4198056
cites work: Hardness results and approximation algorithms for identifying codes and locating-dominating codes in graphs
cites work: Approximation algorithms for connected dominating sets
cites work: A Characterization of Block-Graphs
cites work: Q5572939
cites work: Q4119237
cites work: On Moore Graphs with Diameters 2 and 3
cites work: Landmarks in graphs
cites work: Q5417652
cites work: Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
cites work: The Covert Set-Cover Problem with Application to Network Discovery
cites work: Approximability of identifying codes and locating-dominating codes
DOI: 10.1016/J.JCSS.2014.06.003
description: scientific article; zbMATH DE number 6346985