Work

Computing distance-bounded node-disjoint paths for all pairs of nodes — An application to optical core network design

Year: 2015

Type: conference-paper

Source: International Workshop on Resilient Networks Design and Modeling (RNDM)

DOI: 10.1109/rndm.2015.7324311

Authors: Deepak Mehta, Barry O'Sullivan, Cemalletin Ozturk, Luis Quesada

Institution: University College Cork

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

SDG: Industry, innovation and infrastructure

Open Access status: closed

OpenAlex ID: W1993869612

FWCI: 0.712

Cites: 17

Cited by: 4

Related to: 10