Considerations for visualizing comparison
M Gleicher - IEEE transactions on visualization and computer …, 2017 - ieeexplore.ieee.org
Supporting comparison is a common and diverse challenge in visualization. Such support is
difficult to design because solutions must address both the specifics of their scenario as well …
difficult to design because solutions must address both the specifics of their scenario as well …
Invariants of distance k-graphs for graph embedding
W Czech - Pattern Recognition Letters, 2012 - Elsevier
Graph comparison algorithms based on metric space embedding have been proven robust
in graph clustering and classification. In this paper we propose graph embedding method …
in graph clustering and classification. In this paper we propose graph embedding method …
Distributed computing of distance‐based graph invariants for analysis and visualization of complex networks
W Czech, W Mielczarek… - … and Computation: Practice …, 2017 - Wiley Online Library
We present a new framework for analysis and visualization of complex networks based on
structural information retrieved from their distance k‐graphs and B‐matrices. The …
structural information retrieved from their distance k‐graphs and B‐matrices. The …
[PDF][PDF] Optimizes NP Problem with Integration of GPU Based Parallel Computing
S Kumar, SS Dhable, AD Potgantwar - International Journal of Scientific …, 2017 - ijsrnsc.org
Revised 28th May 2017, Accepted 14th Jun 2017, Online 30th Jun 2017 Abstract—There
are different number of optimization problems are present those are NP problems. Graph …
are different number of optimization problems are present those are NP problems. Graph …
Review of Graph Invariants for Quantitative Analysis of Structure Dynamics
In this work we review graph invariants used for quantitative analysis of evolving graphs.
Focusing on graph datasets derived from structural pattern recognition and complex …
Focusing on graph datasets derived from structural pattern recognition and complex …
[PDF][PDF] Wydzia l Elektrotechniki, Automatyki, Informatyki i Elektroniki
W Czech - Citeseer
This thesis concerns exact and inexact graph matching algorithms based on algebraic
representsations of graphs, ie, matrices or vectors. We focus on approximate graph …
representsations of graphs, ie, matrices or vectors. We focus on approximate graph …