Research map / Graph learning / Graph algorithms and clustering
Finding Minimum-Weight Link-Disjoint Paths with a Few Common Nodes
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use the augmenting-path plus node-splitting algorithm LDP instead of the ILP solver | Restricted (k, delta)-LDP · random graphs (1000,100000,12), k=2 | running time (s): 6.920 -> 2.281 | Helped |
| use LDP instead of ILP on large real SNAP networks | Restricted (k, delta)-LDP · Email-EuALL, k=2 | running time (s): 469.81 -> 26.88 | Helped |
| use LDP instead of ILP when k is large on dense random graphs | Restricted (k, delta)-LDP · random graphs (800,64000,12), k=5 | running time (s): 3.890 -> 3.782 | No clear effect |
Closest papers by meaning
- Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks (AAAI 2025 · similarity 0.85)
- Solving Multiagent Path Finding on Highly Centralized Networks (AAAI 2025 · similarity 0.84)
- Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures (AAAI 2025 · similarity 0.84)
- Resource Constrained Pathfinding with Enhanced Bidirectional A* Search (AAAI 2025 · similarity 0.83)
- Exact Algorithms and Lowerbounds for Multiagent Path Finding: Power of Treelike Topology (AAAI 2024 · similarity 0.83)
- Paths, Proofs, and Perfection: Developing a Human-Interpretable Proof System for Constrained Shortest Paths (AAAI 2024 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.