scientific article; zbMATH DE number 7075920

zbMATH Open1409.68210MaRDI QIDQ4967220

Gianlorenzo D'angelo

Publication date: 3 July 2019

Full work available at URL: http://bulletin.eatcs.org/index.php/beatcs/article/view/443/446

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items (1)

Approximating the Restricted 1-Center in Graphs

Recommendations

• Unnamed Item 👍 👎
• Optimal centrality computations within bounded clique-width graphs 👍 👎
• Fast approximation of centrality 👍 👎
• Maximum Betweenness Centrality: Approximability and Tractable Cases 👍 👎
• Fast Approximation of Centrality 👍 👎
• Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs 👍 👎
• The Parameterized Complexity of Centrality Improvement in Networks 👍 👎
• Approximating Betweenness Centrality 👍 👎
• Sublinear Algorithms for Local Graph-Centrality Estimation 👍 👎
• The stochastic pseudo-star degree centrality problem 👍 👎

This page was built for publication: