Finding Two Disjoint Paths in a Network With Normalized Α + -MIN-SUM Objective Function

Lecture Notes in Computer Science - Germany
doi 10.1007/11602613_95
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

2018English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Disjoint Sum Forms in Reliability Theory

ORiON
2014English

Covering a Strong Digraph by Α−1 Disjoint Paths: A Proof of Las Vergnas' Conjecture

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2001English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Minimum Activation Cost Node-Disjoint Paths in Graphs With Bounded Treewidth

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001English

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy