A framework for path-oriented network simplification

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6065 LNCS, Issue , 2010, Pages 220-231

  Toivonen, Hannu ^a   Mahler, Sébastien ^a   Zhou, Fang ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC VARIANTS; ANALYSIS METHOD; BIOLOGICAL NETWORKS; COMPLEX METHODS; FLOW NETWORK; GENERIC FRAMEWORKS; INTELLIGENT ANALYSIS; LARGE NETWORKS; MAXIMUM FLOWS; MAXIMUM PROBABILITY; NETWORK SIMPLIFICATION; PRE-PROCESSING STEP; RANDOM GRAPHS; RELATIVE NEIGHBORHOOD GRAPHS; SHORTEST PATH; SIMPLIFICATION METHOD; SPANNING TREE; UNDERSTANDABILITY; USER-CENTRIC;

DATA REDUCTION; GRAPH THEORY; GRAPHIC METHODS;

TREES (MATHEMATICS);

EID: 77953774732     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13062-5_21     Document Type: Conference Paper

References (14)

1. Sevon, P., Eronen, L., Hintsanen, P., Kulovesi, K., Toivonen, H.: Link discovery in graphs derived from biologican databases. In: Leser, U., Naumann, F., Eckmann, B. (eds.) DILS 2006, Part I. LNCS (LNBI), vol.4705, pp. 35-49. Springer, Heidelberg (2006)
2. Hintsanen, P., Toivonen, H.: Finding reliable subgraphs from large probabilistic graphs. Data Mining and Knowledge Discovery 17, 3-23 (2008)
3. Berthold, M.R., Dill, F., Kötter, T., Thiel, K.: Supporting creativity: Towards associative discovery of new insights. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.5012, pp. 14-25. Springer, Heidelberg (2008)
4. Johnson, D.B.: Efficient algorithms for shortest paths in sparse networks. Journal of the ACM 24(1), 1-13 (1977)
5. Biedl, T.C., Brejova, B., Vinar, T.: Simplifying flow networks. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.1893, pp. 192-201. Springer, Heidelberg (2000)
6. Misiolek, E., Chen, D.Z.: Two flow network simplification algorithms. Information Processing Letters 97, 197-202 (2006)
7. Schvaneveldt, R., Durso, F., Dearholt, D.: Network structures in proximity data. In: The Psychology of Learning and Motivation: Advances in Research and Theory, vol.24, pp. 249-284. Academic Press, New York
8. Quirin, A., Cordon, O., Santamaria, J., Vargas-Quesada, B., Moya-Anegon, F.: A new variant of the pathfinder algorithm to generate large visual science maps in cubic time. Information Processing and Management 44, 1611-1623 (2008)
9. Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recognition 12(4), 261-268 (1980)
10. Veltkamp, R.C.: The gamma-neighborhood graph. Computational Geometry 1, 227-246 (1991)
11. Kruskal, J.B.: On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 7, 48-50 (1956)
12. Osipov, V., Sanders, P., Singler, J.: The filter-kruskal minimum spanning tree algorithm. In: Finocchi, I., Hershberger, J. (eds.) ALENEX, pp. 52-61. SIAM, Philadelphia (2009)
13. Köhler, S., Bauer, S., Horn, D., Robinson, P.: Walking the interactome for prioritization of candidate disease genes. American Journal of Human Genetics 82(4), 949-958 (2008)
14. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the Association for Computing Machinery 19(2), 248-264 (1972)