scientific article; zbMATH DE number 5663542
From MaRDI portal
Publication:5852580
zbMath1189.68087MaRDI QIDQ5852580
Rami Puzis, Yuval Elovici, Shlomi Dolev
Publication date: 27 January 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (11)
Novel centrality metrics for studying essentiality in protein‐protein interaction networks based on group structures ⋮ Efficient algorithms for game-theoretic betweenness centrality ⋮ A measure for a balanced workload and its extremal values ⋮ Potential-based bounded-cost search and anytime non-parametric A* ⋮ Incremental deployment of network monitors based on Group Betweenness Centrality ⋮ On the maximum betweenness improvement problem ⋮ Maximum Betweenness Centrality: Approximability and Tractable Cases ⋮ Structural Search and Optimization in Social Networks ⋮ An integer programming approach for finding the most and the least central cliques ⋮ Group centralization of network indices ⋮ Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs
This page was built for publication:
