Fast approximation of eccentricities and distances in hyperbolic graphs (Q4968378): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Pajek / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Pajek datasets / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KONECT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7155/jgaa.00496 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2951873711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for center problems in cactus networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Approximation of Distances in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Hyperbolicity of Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Into the square: on the complexity of some quadratic-time solvable problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast diameter and radius BFS-based computation in (weakly connected) real-world graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance Approximating Trees for Chordal and Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algorithmic use of hypertree structure and maximum neighbourhood orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: LexBFS-orderings and powers of chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bounds for Approximating Extremal Distances in Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5115790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Approximation Algorithms for the Graph Diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a central vertex in an HHD-free graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameters, centers, and approximating trees of delta-hyperbolicgeodesic spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive spanners and distance and routing labeling schemes for hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation of centrality and distances in hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core congestion is inherent in hyperbolic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering δ-Hyperbolic Spaces by Balls / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Gromov Hyperbolicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter determination on restricted graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of BFS to determine a graph's diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Pairs Almost Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-decompositions with bags of small diameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost diameter of a house-hole-free graph in linear time via LexBFS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating all pairs shortest paths in restricted graph families: a unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eccentricity approximating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: LexBFS-orderings of distance-hereditary graphs with application to the diametral pair problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The absolute center of a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for \(p\)-centers in large \(\delta \)-hyperbolic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing almost shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of \(k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive Tree Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree 3-spanners on interval, permutation and regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear-time algorithm for computing the center of an interval graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance approximating spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eccentricity-approximating trees in chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithms for the diameter and radius of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dynamic shortest paths problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact oracles for reachability and approximate distances in planar digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metric Embedding, Hyperbolic Space, and Social Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Diameter of Planar Graphs in Near Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363756 / rank
 
Normal rank

Latest revision as of 22:05, 19 July 2024

scientific article; zbMATH DE number 7080126
Language Label Description Also known as
English
Fast approximation of eccentricities and distances in hyperbolic graphs
scientific article; zbMATH DE number 7080126

    Statements

    Fast approximation of eccentricities and distances in hyperbolic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references