The strict terminal connection problem on chordal bipartite graphs

DOI10.21711/231766362021/RMC4814MaRDI QIDQ6496802zbMATH OpenFDO

Authors Alexsander Andrade de Melo, Celina Miraglia Herrera de Figueiredo, Uéverton dos Santos Souza

Publication date 6 May 2024

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

Full work available at URL https://doi.org/10.21711/231766362021/RMC4814

zbMATH Keywords

\textsf{NP}-completenesschordal bipartite graphsconnection treeSteiner treeterminal vertices

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On the terminal connection problem
• A multivariate analysis of the strict terminal connection problem
• Connecting terminals using at most one router
• On the computational difficulty of the terminal connection problem
• scientific article; zbMATH DE number 6423757

Cited in

(1)

• Connecting terminals using at most one router

This page was built for publication: The strict terminal connection problem on chordal bipartite graphs

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