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

doi 10.1109/ict.2018.8464840
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

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

International Journal of Networking and Computing
2011English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

The Two Disjoint Path Problem and Wire Routing Design

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1981English

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

Approximation Algorithms for Edge-Disjoint Paths and Unsplittable Flow

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Blossom Algorithm for Maximum Edge-Disjoint T-Paths

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy