The strict terminal connection problem on chordal bipartite graphs

DOI10.21711/231766362021/RMC4814MaRDI QIDQ6496802FDOQ6496802

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)

zbMATH Keywords

Steiner treechordal bipartite graphsconnection treeterminal vertices\textsf{NP}-completeness

Mathematics Subject Classification ID

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

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)