Improved Algorithms for the 2-Vertex Disjoint Paths Problem

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-540-95891-8_49

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Construction of Vertex-Disjoint Paths in Alternating Group Networks

Journal of Supercomputing
HardwareInformation SystemsTheoretical Computer ScienceArchitectureSoftware
2009English

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Automatically Generated Algorithms for the Vertex Coloring Problem

PLoS ONE
Multidisciplinary
2013English

Improved Algorithms for the Permuted Kernel Problem

English

Improved Update/Query Algorithms for the Interval Valuation Problem

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1987English

Improved Approximation Algorithms for Firefighter Problem on Trees

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2011English

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020Norwegian Bokmål

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy