Amanote Research

Amanote Research

  • Register
  • Sign In

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science- Germany

doi 10.1007/11604686_28

Full Text

Abstract

Available in

Categories

Computer ScienceTheoretical Computer Science

Date

January 1, 2005

Authors

Torsten Tholey

Publisher

Springer Berlin Heidelberg


Related search

Using Directed Acyclic Graphs for Investigating Causal Paths for Cardiovascular Disease

Journal of Biometrics & Biostatistics
2013English

Max-Linear Models on Directed Acyclic Graphs

Bernoulli
StatisticsProbability
2018English

Induced Disjoint Paths in Claw-Free Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2015English

Corrigendum: Edge-Disjoint Paths in Expander Graphs

SIAM Journal on Computing
MathematicsComputer Science
2001Norwegian

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2009Norwegian Bokmål

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Directed Acyclic Graphs With Edge-Specific Bounds

Biometrika
StatisticsProbabilityUncertaintyApplied MathematicsBiological SciencesAgriculturalMathematics
2011English

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Edge Weight Reduction Problems in Directed Acyclic Graphs

Journal of Algorithms
1997English

Amanote Research

Note-taking for researchers

Follow Amanote


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

Privacy PolicyRefund Policy