Pages that link to "Item:Q1991876"

The following pages link to Fifty years of graph matching, network alignment and network comparison (Q1991876):

Displaying 31 items.

• Graph distance measures based on topological indices revisited (Q669403) (← links)
• Quantitative graph theory: a new branch of graph theory and network science (Q780939) (← links)
• New inequalities for network distance measures by using graph spectra (Q1630771) (← links)
• Network alignment by discrete Ollivier-Ricci flow (Q1725779) (← links)
• New highlights and a new centrality measure based on the adapted PageRank algorithm for urban networks (Q1733726) (← links)
• A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration (Q1733738) (← links)
• Counterexamples to conjectures on graph distance measures based on topological indexes (Q1734753) (← links)
• Stackelberg game based relay selection for physical layer security and energy efficiency enhancement in cognitive radio networks (Q1734754) (← links)
• Network entropies based on independent sets and matchings (Q1736140) (← links)
• Inferring the reputation enhances the cooperation in the public goods game on interdependent lattices (Q1737130) (← links)
• Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances (Q2001629) (← links)
• Compositional properties of alignments (Q2071523) (← links)
• The effect of graph operations on the degree-based entropy (Q2096266) (← links)
• A new coupled disease-awareness spreading model with mass media on multiplex networks (Q2200676) (← links)
• Network similarity measure and Ediz eccentric connectivity index (Q2225483) (← links)
• Comparing large-scale graphs based on quantum probability theory (Q2279341) (← links)
• On efficient network similarity measures (Q2286037) (← links)
• A comparative analysis of new graph distance measures and graph edit distance (Q2293189) (← links)
• Highly unique network descriptors based on the roots of the permanental polynomial (Q2293292) (← links)
• Properties of graph distance measures by means of discrete inequalities (Q2295900) (← links)
• Strong behavioral similarities in timed-arc Petri nets (Q2335136) (← links)
• Impact of self interaction on the evolution of cooperation in social spatial dilemmas (Q2410427) (← links)
• Quantum walk inspired algorithm for graph similarity and isomorphism (Q2681642) (← links)
• Network Distances for Weighted Digraphs (Q4965127) (← links)
• Spectrally Robust Graph Isomorphism (Q5002763) (← links)
• On Network Similarities and Their Applications (Q5016686) (← links)
• Network comparison and the within-ensemble graph distance (Q5161157) (← links)
• Spectral graph matching and regularized quadratic relaxations. I: Algorithm and Gaussian analysis (Q6072326) (← links)
• Subgraph matching on temporal graphs (Q6089960) (← links)
• Relationships between symmetry-based graph measures (Q6139463) (← links)
• Magnitude and Topological Entropy of Digraphs (Q6190600) (← links)