Efficient Heuristics for Determining Node-Disjoint Path Pairs Visiting Specified Nodes

Networks - United States
doi 10.1002/net.21778
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Wiley

Related search

Decompositions of a Set Into Disjoint Pairs

Fundamenta Mathematicae
Number TheoryAlgebra
1955English

Efficient Heuristics for the Minimum Shortest Path Steiner Arborescence Problem With Applications to VLSI Physical Design

1997English

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

2018English

Partial Disjoint Path for Multi-Layer Protection in GMPLS Networks

English

Finding Non-Dominated Bicriteria Shortest Pairs of Disjoint Simple Paths

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2009English

Efficient Algorithms for Listing K Disjoint St-Paths in Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

The Two Disjoint Path Problem and Wire Routing Design

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1981English

Heuristics for Designing Energy-Efficient Wireless Sensor Network Topologies

Journal of Networks
2009English

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

International Journal of Networking and Computing
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy