A multivariate analysis of the strict terminal connection problem
From MaRDI portal
Publication:2306846
DOI10.1016/j.jcss.2020.02.001zbMath1435.90040OpenAlexW3005880974MaRDI QIDQ2306846
Alexsander A. Melo, Uéverton S. Souza, Celina M. H. Figueiredo
Publication date: 26 March 2020
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2020.02.001
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Deterministic network models in operations research (90B10)
Related Items (3)
On the terminal connection problem ⋮ On the computational difficulty of the terminal connection problem ⋮ On undirected two‐commodity integral flow, disjoint paths and strict terminal connection problems
Cites Work
- Unnamed Item
- Unnamed Item
- Directed Steiner trees with diffusion costs
- On some network design problems with degree constraints
- On the hardness of full Steiner tree problems
- The full Steiner tree problem
- Kernelization hardness of connectivity problems in \(d\)-degenerate graphs
- A note on the terminal Steiner tree problem
- On approximation algorithms for the terminal Steiner tree problem
- A linear time algorithm for full Steiner trees
- 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
- Diminishable parameterized problems and strict polynomial kernelization
- 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
- On full Steiner trees in unit disk graphs
- Algorithms for terminal Steiner trees
- Steiner Problems with Limited Number of Branching Nodes
- Defining and identifying cograph communities in complex networks
- 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
- Kernelization Lower Bounds by Cross-Composition
- Reducibility among Combinatorial Problems
- Parameterized Algorithms
- The steiner problem in graphs
This page was built for publication: A multivariate analysis of the strict terminal connection problem
