Saved in:
| Main Authors: | Gao, Xiangyu, Li, Jianzhong, Miao, Dongjing |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2303.00259 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024)
by: Ning, Baoling, et al.
Published: (2024)
Computing the Center of Uncertain Points on Cactus Graphs
by: Hu, Ran, et al.
Published: (2024)
by: Hu, Ran, et al.
Published: (2024)
Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
by: Zhao, Zhuowei, et al.
Published: (2024)
by: Zhao, Zhuowei, et al.
Published: (2024)
Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026)
by: Tacheny, Nicolas
Published: (2026)
Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)
by: Wang, Zeyu, et al.
Published: (2026)
The k-Center Problem of Uncertain Points on Graphs
by: Xu, Haitao, et al.
Published: (2025)
by: Xu, Haitao, et al.
Published: (2025)
The Two-Center Problem of Uncertain Points on Trees
by: Xu, Haitao, et al.
Published: (2024)
by: Xu, Haitao, et al.
Published: (2024)
Orienteering (with Time Windows) on Restricted Graph Classes
by: Buchin, Kevin, et al.
Published: (2024)
by: Buchin, Kevin, et al.
Published: (2024)
The Two-Center Problem of Uncertain Points on Cactus Graphs
by: Xu, Haitao, et al.
Published: (2024)
by: Xu, Haitao, et al.
Published: (2024)
Computational Complexity Analysis of Interval Methods in Solving Uncertain Nonlinear Systems
by: Prakash, Rudra, et al.
Published: (2026)
by: Prakash, Rudra, et al.
Published: (2026)
Location-Restricted Stable Matching
by: Castro, Garret
Published: (2025)
by: Castro, Garret
Published: (2025)
Set Selection with Uncertain Weights: Non-Adaptive Queries and Thresholds
by: Dürr, Christoph, et al.
Published: (2024)
by: Dürr, Christoph, et al.
Published: (2024)
Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Semirandom Planted Clique and the Restricted Isometry Property
by: Błasiok, Jarosław, et al.
Published: (2024)
by: Błasiok, Jarosław, et al.
Published: (2024)
Hitting Geodesic Intervals in Structurally Restricted Graphs
by: Gima, Tatsuya, et al.
Published: (2025)
by: Gima, Tatsuya, et al.
Published: (2025)
Efficient Stochastic Routing in Path-Centric Uncertain Road Networks -- Extended Version
by: Guo, Chenjuan, et al.
Published: (2024)
by: Guo, Chenjuan, et al.
Published: (2024)
Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
by: Amir, Amihood, et al.
Published: (2024)
by: Amir, Amihood, et al.
Published: (2024)
Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
by: Ashvinkumar, Vikrant, et al.
Published: (2024)
by: Ashvinkumar, Vikrant, et al.
Published: (2024)
High Probability Work Efficient Parallel Algorithms
by: Hutton, Chase, et al.
Published: (2026)
by: Hutton, Chase, et al.
Published: (2026)
Estimating Random-Walk Probabilities in Directed Graphs
by: Bertram, Christian, et al.
Published: (2025)
by: Bertram, Christian, et al.
Published: (2025)
Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
by: Zhao, Zhuowei, et al.
Published: (2025)
by: Zhao, Zhuowei, et al.
Published: (2025)
TRAPP: An Efficient Point-to-Point Path Planning Algorithm for Road Networks with Restrictions
by: Chen, Hanzhang, et al.
Published: (2024)
by: Chen, Hanzhang, et al.
Published: (2024)
Preprocessing Uncertain Data into Supersequences for Sorting and Gaps
by: Löffler, Maarten, et al.
Published: (2026)
by: Löffler, Maarten, et al.
Published: (2026)
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
by: Kobayashi, Yusuke, et al.
Published: (2026)
by: Kobayashi, Yusuke, et al.
Published: (2026)
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)
by: Cai, Xinwei, et al.
Published: (2023)
Simultaneously Approximating All Norms for Massively Parallel Correlation Clustering
by: Cao, Nairen, et al.
Published: (2024)
by: Cao, Nairen, et al.
Published: (2024)
Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
by: Shiran, Maryam
Published: (2025)
by: Shiran, Maryam
Published: (2025)
Broadcasting under Structural Restrictions
by: Egami, Yudai, et al.
Published: (2025)
by: Egami, Yudai, et al.
Published: (2025)
A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)
by: Nowak, Franz, et al.
Published: (2023)
Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
by: Zhou, Alexander, et al.
Published: (2026)
by: Zhou, Alexander, et al.
Published: (2026)
All-Hops Shortest Paths
by: Williams, Virginia Vassilevska, et al.
Published: (2024)
by: Williams, Virginia Vassilevska, et al.
Published: (2024)
With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
by: Canonne, Clément L., et al.
Published: (2025)
by: Canonne, Clément L., et al.
Published: (2025)
Computing Hamiltonian Paths with Partial Order Restrictions
by: Beisegel, Jesse, et al.
Published: (2024)
by: Beisegel, Jesse, et al.
Published: (2024)
Embedding Probability Distributions into Low Dimensional $\ell_1$: Tree Ising Models via Truncated Metrics
by: Charikar, Moses, et al.
Published: (2023)
by: Charikar, Moses, et al.
Published: (2023)
A Little Clairvoyance Is All You Need
by: Gupta, Anupam, et al.
Published: (2025)
by: Gupta, Anupam, et al.
Published: (2025)
A Parameterized Perspective on Uniquely Restricted Matchings
by: Chaudhary, Juhi, et al.
Published: (2025)
by: Chaudhary, Juhi, et al.
Published: (2025)
The Probability to Hit Every Bin with a Linear Number of Balls
by: Walzer, Stefan
Published: (2024)
by: Walzer, Stefan
Published: (2024)
All-Subsets Important Separators with Applications to Sample Sets, Balanced Separators and Vertex Sparsifiers in Directed Graphs
by: Anand, Aditya, et al.
Published: (2025)
by: Anand, Aditya, et al.
Published: (2025)
Faster All-Pairs Optimal Electric Car Routing
by: Dorfman, Dani, et al.
Published: (2025)
by: Dorfman, Dani, et al.
Published: (2025)
Enumerating All Directed Spanning Trees in Optimal Time
by: Gawrychowski, Paweł, et al.
Published: (2026)
by: Gawrychowski, Paweł, et al.
Published: (2026)
Similar Items
-
Balanced Partitioning for Optimizing Big Graph Computation: Complexities and Approximation Algorithms
by: Ning, Baoling, et al.
Published: (2024) -
Computing the Center of Uncertain Points on Cactus Graphs
by: Hu, Ran, et al.
Published: (2024) -
Dynamic Structural Clustering Unleashed: Flexible Similarities, Versatile Updates and for All Parameters
by: Zhao, Zhuowei, et al.
Published: (2024) -
Skyline-First Traversal as a Control Mechanism for Multi-Criteria Graph Search
by: Tacheny, Nicolas
Published: (2026) -
Finding the Balance Rate of Uncertain Signed Graphs
by: Wang, Zeyu, et al.
Published: (2026)