scientific article; zbMATH DE number 1919454

MaRDI QIDQ4483845zbMATH OpenFDO

Authors Xianghui Liu, Jianping Yin, Le-Le Tang, Jianmin Zhao

Publication date 27 May 2003

zbMATH Keywords

weak vertex cover set

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Algorithm for the network flow monitoring set based on primal-dual method
• Computing and Combinatorics
• Approximating the minimum weight weak vertex cover
• Algorithmic Applications in Management
• Algorithms for Placing Monitors in a Flow Network

Cited in

(12)

• A netflow based flow analysis and monitoring system in enterprise networks
• A distributed algorithm for monitor-nodes selection in net traffic measurement
• Very Simple Methods for All Pairs Network Flow Analysis
• Algorithms for Placing Monitors in a Flow Network
• Computing and Combinatorics
• scientific article; zbMATH DE number 2112440 (Why is no real title available?)
• Graph covering via shortest paths
• The distributed network monitoring model with bounded delay constraints
• Algorithm for the network flow monitoring set based on primal-dual method
• Algorithmic Applications in Management
• Network efficiency and vulnerability analysis using the flow‐weighted efficiency measure
• Approximating the minimum weight weak vertex cover

This page was built for publication:

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