The following pages link to STACS 2005 (Q5710705):
Displaying 22 items.
- Generalized network measures based on modulus of families of walks (Q298245) (← links)
- A measure for a balanced workload and its extremal values (Q906433) (← links)
- Centrality measure in graphs (Q977050) (← links)
- Structural evaluation for distribution networks with distributed generation based on complex network (Q1688109) (← links)
- Machine learning for graph-based representations of three-dimensional discrete fracture networks (Q1710361) (← links)
- A new measure of identifying influential nodes: efficiency centrality (Q2005232) (← links)
- A variant of the current flow betweenness centrality and its application in urban networks (Q2008542) (← links)
- Sparse randomized shortest paths routing with Tsallis divergence regularization (Q2036747) (← links)
- Randomized shortest paths with net flows and capacity constraints (Q2127057) (← links)
- Polynomial-time algorithms for submodular Laplacian systems (Q2235770) (← links)
- A centrality measure in dense networks based on two-way random walk betweenness (Q2246034) (← links)
- A modified Myerson value for determining the centrality of graph vertices (Q2660510) (← links)
- Resistance-distance betweenness: definition, properties, and application in complex linguistic networks (Q2683119) (← links)
- Analyzing complex networks through correlations in centrality measurements (Q3302262) (← links)
- Effective graph classification based on topological and label attributes (Q4969844) (← links)
- Central Positions in Social Networks (Q5042225) (← links)
- Betweenness centrality in Cartesian product of graphs (Q5154628) (← links)
- (Q5240346) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- Disjoint multipath closeness centrality (Q6103302) (← links)
- An Edge Centrality Measure Based on the Kemeny Constant (Q6158484) (← links)
- Axiomatic characterization of PageRank (Q6161485) (← links)
