-In this article, the authors perform an analysis in order to assess adaptation of magnetic force-directed algorithms for context-based information extraction from multi-attributed graphs during visualization sessions. Theoretic standings behind magnetic force-directed approach are stated together with review on how particular features of respective algorithms in combination with appropriate visual techniques are especially suitable for improved processing and presenting of knowledge that is captured in form of graphs. The complexity of retrieving multi-attributed information within the proposed approach is handled with dedicated tools, such as selective attraction of nodes to MFE (Magnetic Force Emitter) based on search criteria, localization of POI (Point of Interest) regions, graph node anchoring, etc. Implicit compatibility of aforementioned tools with interactive nature of data exploration is distinguished. Description of case study, based on bibliometric network analysis is given, which is followed by the review of existing related works in this field. Conclusions are made and further studies in the field of visualization of multi-attributed graphs are defined.