Pages that link to "Item:Q990638"
From MaRDI portal
The following pages link to Structural similarity of directed universal hierarchical graphs: a low computational complexity approach (Q990638):
Displaying 9 items.
- A hierarchical network model for epidemic spreading. analysis of A/H1N1 virus spreading in Romania (Q272536) (← links)
- Two approaches to determining similarity of two digraphs (Q395481) (← links)
- Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
- A similarity measure for graphs with low computational complexity (Q861127) (← links)
- Structure-based graph distance measures of high degree of precision (Q947972) (← links)
- A comparative analysis of the Tanimoto index and graph edit distance for measuring the topological similarity of trees (Q1636844) (← links)
- Counterexamples to conjectures on graph distance measures based on topological indexes (Q1734753) (← links)
- Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
- Visual Similarity Perception of Directed Acyclic Graphs: A Study on Influencing Factors and Similarity Judgment Strategies (Q4961760) (← links)
