Connecting terminals using at most one router

DOI10.21711/231766362017/RMC456MaRDI QIDQ6489473zbMATH OpenFDO

Authors Alexsander A. Melo, Celina M. H. de Figueiredo, Uéverton S. Souza

Publication date 22 April 2024

Published in Matemática Contemporânea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.21711/231766362017/RMC456

zbMATH Keywords

bounded number of routersdisjoint pathsSteiner treestrict connection treeterminal connection

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorics on words (68R15)

Recommendations

• On the terminal connection problem
• On the computational difficulty of the terminal connection problem
• The strict terminal connection problem on chordal bipartite graphs
• scientific article; zbMATH DE number 6423757
• A multivariate analysis of the strict terminal connection problem

Cited in

(1)

• The strict terminal connection problem on chordal bipartite graphs

This page was built for publication: Connecting terminals using at most one router

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6489473)