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

Lecture Notes in Computer Science - Germany
doi 10.1007/10719839_32
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Categorical Views on Computations on Trees (Extended Abstract)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Arc-Disjoint In-Trees in Directed Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2009English

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Induced Disjoint Paths in Circular-Arc Graphs in Linear Time

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Node-To-Set Disjoint-Paths Routing in Recursive Dual-Net

International Journal of Networking and Computing
2011English

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

Semi-Preemptive Routing on Trees

Discrete Applied Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2008English

On Privacy Homomorphisms (Extended Abstract)

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy