Amanote Research

Amanote Research

    RegisterSign In

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

International Journal of Networking and Computing
doi 10.15803/ijnc.1.2_178
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2011

Authors
Yamin LiShietung PengWanming Chu
Publisher

IJNC Editorial Committee


Related search

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

2018English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Secure Data Transmission Through Node-Disjoint on Demand Multipath Routing in Manets

INTERNATIONAL JOURNAL OF COMPUTER ENGINEERING & TECHNOLOGY
2019English

Node-Disjoint On-Demand Multipath Routing With Route Utilization in Ad-Hoc Networks

International Journal of Computer Applications
2013English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

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

Complexity of Disjoint Paths Problems in Planar Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1993English

Finding Disjoint Paths on Directed Acyclic Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy