Amanote Research

Amanote Research

    RegisterSign In

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica - Germany
doi 10.1007/s00493-009-2428-z
Full Text
Open PDF
Abstract

Available in full text

Categories
CombinatoricsComputational MathematicsDiscrete Mathematics
Date

March 1, 2009

Authors
Naoyuki KamiyamaNaoki KatohAtsushi Takizawa
Publisher

Springer Science and Business Media LLC


Related search

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Searching Cycle-Disjoint Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

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
2001English

On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths Extended Abstract

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Disjoint Identifying-Codes for Arbitrary Graphs

2005English

Computing Vertex-Disjoint Paths in Large Graphs Using MAOs

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy