التفاصيل البيبلوغرافية
| العنوان: |
2(浙江师范大 学 计算机学院,浙 江 金 华 321004) Analysis of Efficient Monitoring Method for the Network Flow |
| المؤلفون: |
Liu Xiang-hui, Yin Jian-ping, Tang Le-le, Zhao Jian-min |
| المساهمون: |
The Pennsylvania State University CiteSeerX Archives |
| المصدر: |
http://www.jos.org.cn/1000-9825/14/300.pdfTest. |
| المجموعة: |
CiteSeerX |
| مصطلحات موضوعية: |
Received 2002-05-10, Accepted 2002-10-11 |
| الوصف: |
Software, 2003,14(2):300~304. Abstract: In this paper, the problem of efficient monitoring for the network flow is regarded as the problem to find out the minimum weak vertex cover set for a given graph G=(V,E). An approximation algorithm is presented. It is proved that the algorithm has a ratio bound of 2(lnd+1), where d is the maximum degree of the vertices in graph G. It is showed that the running time of the algorithm is O(|V|2). Key words: weak vertex cover; NP-hard; approximation algorithm; flow conservation 摘 要: 把网络流量的有效测量问题抽象为求给定 图 G=(V,E)的最小弱顶点覆盖集的问题.给出了一个求最小弱 |
| نوع الوثيقة: |
text |
| وصف الملف: |
application/pdf |
| اللغة: |
English |
| العلاقة: |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.569.3127Test; http://www.jos.org.cn/1000-9825/14/300.pdfTest |
| الإتاحة: |
http://www.jos.org.cn/1000-9825/14/300.pdfTest |
| حقوق: |
Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: |
edsbas.1C5EB088 |
| قاعدة البيانات: |
BASE |
