On the terminal connection problem
From MaRDI portal
Publication:831820
DOI10.1007/978-3-030-67731-2_20zbMath1490.68150OpenAlexW3125354819MaRDI QIDQ831820
Uéverton S. Souza, Alexsander A. de Melo, Celina M. Herrera de Figueiredo
Publication date: 24 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-67731-2_20
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Directed Steiner trees with diffusion costs
- The full Steiner tree problem
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
- Characterizations of strongly chordal graphs
- The NP-completeness of Steiner tree and dominating set for chordal bipartite graphs
- Complement reducible graphs
- Permutation graphs: Connected domination and Steiner trees
- The Steiner tree problem
- On the terminal Steiner tree problem.
- Spanning spiders and light-splitting switches
- HAMILTONian circuits in chordal bipartite graphs
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- A multivariate analysis of the strict terminal connection problem
- Fast exact algorithms for some connectivity problems parameterized by clique-width
- Steiner Problems with Limited Number of Branching Nodes
- Fourier meets M\"{o}bius: fast subset convolution
- A Linear Recognition Algorithm for Cographs
- Steiner trees, connected domination and strongly chordal graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- Hamilton Paths in Grid Graphs
- Reducibility among Combinatorial Problems
- The steiner problem in graphs
This page was built for publication: On the terminal connection problem
