Simpler, Faster and Shorter Labels for Distances in Graphs

doi 10.1137/1.9781611974331.ch25
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Grouping Techniques for Scheduling Problems: Simpler and Faster

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

Simpler and Faster Dictionaries on the AC0 RAM

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Shorter Notes: An Even Simpler Proof of Opial's Inequality

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Faster Algorithms for Quantitative Verification in Constant Treewidth Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Promising-Arm/Risc-V: A Simpler and Faster Operational Concurrency Model

2019English

Faster Algorithms for Computing Maximal 2-Connected Subgraphs in Sparse Directed Graphs

2017English

Euclidean Distances, Soft and Spectral Clustering on Weighted Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Extremal Distances in Directed Graphs: Tight Spanners and Near-Optimal Approximation Algorithms

2020English

Electrical Flows, Laplacian Systems, and Faster Approximation of Maximum Flow in Undirected Graphs

2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy