Results 51 to 60 of about 2,276,545 (363)
An Information-Theoretic Framework for Evaluating Edge Bundling Visualization
Entropy, 2018 Edge bundling is a promising graph visualization approach to simplifying the visual result of a graph drawing. Plenty of edge bundling methods have been developed to generate diverse graph layouts.
Jieting Wu +3 more
doaj +1 more source
Experimental Evaluation of Book Drawing Algorithms
, 2017 A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if
Klawitter, Jonathan +2 more
core +2 more sources
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2020 Securing cyber-physical systems (CPS) and Internet of Things (IoT) systems requires the identification of how interdependence among existing atomic vulnerabilities may be exploited by an adversary to stitch together an attack that can compromise the ...
Alaa T. Al Ghazo +3 more
semanticscholar +1 more source
Layerwise Relevance Visualization in Convolutional Text Graph Classifiers [PDF]
Conference on Empirical Methods in Natural Language Processing, 2019 Representations in the hidden layers of Deep Neural Networks (DNN) are often hard to interpret since it is difficult to project them into an interpretable domain.
Robert Schwarzenberg +4 more
semanticscholar +1 more source
Interactive visualization of genealogical graphs [PDF]
IEEE Symposium on Information Visualization, 2005. INFOVIS 2005., 2005 The general problem of visualizing "family trees", or genealogical graphs, in 2D, is considered. A graph theoretic analysis is given, which identifies why genealogical graphs can be difficult to draw. This motivates some novel graphical representations, including one based on a dual tree, a subgraph formed by the union of two trees.
M.J. McGuffin, R. Balakrishnan
openaire +1 more source
Drawing Big Graphs using Spectral Sparsification
, 2017 Spectral sparsification is a general technique developed by Spielman et al. to reduce the number of edges in a graph while retaining its structural properties.
Eades, Peter +2 more
core +1 more source
Visualizing weighted edges in graphs [PDF]
Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003., 2004 This paper introduces a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility.
Rodgers, P., Mutton, P.
openaire +1 more source
Complex search: aggregation, discovery, and synthesis; pp. 89–106 [PDF]
Proceedings of the Estonian Academy of Sciences, 2012 Search engines such as Google, Bing, and Yahoo, supplemented by other information search portals like Wikipedia, have become the means for searching information on the Internet.
Georg Singer +2 more
doaj +1 more source
Assembly Graph Browser: interactive visualization of assembly graphs [PDF]
Bioinformatics, 2019 Abstract Summary Currently, most genome assembly projects focus on contigs and scaffolds rather than assembly graphs that provide a more comprehensive representation of an assembly. Since interactive visualization of large assembly graphs remains an open problem, we developed an Assembly Graph Browser
Alla Mikheenko, Mikhail Kolmogorov
openaire +2 more sources
Software for Graph Analysis and Visualization
Моделирование и анализ информационных систем, 2014 This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic ...
M. I. Kolomeychenko +3 more
doaj +1 more source