2013•Electronic Notes in Discrete MathematicsOpen access

On the Hardness of Equal Shortest Path Routing

Frédéric Giroire, Stéphane Pérennès, Issam Tahiri

Open full text 3 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Constrained Shortest Path First, Private Network-to-Network Interface, Shortest path problem, K shortest path routing, Path vector protocol, Equal-cost multi-path routing, Computer science, Link-state routing protocol

Back to paper search Browse research topics Original source

On the Hardness of Equal Shortest Path Routing — Research Paper | ScholarLens