Benutzer: Gast  Login
Dokumenttyp:
Report / Forschungsbericht 
Autor(en):
Stefan Eckhardt; Sven Kosub; Moritz G. Maaß; Hanjo Täubig; Sebastian Wernicke 
Titel:
Combinatorial Network Abstraction by Trees and Distances 
Abstract:
We draw attention to network abstraction as a fundamental problem within network analysis and visualization. A combinatorial network abstraction problem is specified by a class P of pattern graphs and a real-valued similarity measure rho based on certain graph properties. For fixed P and rho, the optimization task on any graph G is finding a subgraph G' which belongs to P such that rho(G,G') is minimal. In this work, we consider this problem for the natural case of trees (as the class of pattern...    »
 
Stichworte:
Spanning trees; network analysis; network abstraction; NP-completeness 
Jahr:
2005 
Seiten/Umfang:
28 
Sprache:
de 
Format:
Text