Efficient location of resources in cylindrical networks
DOI10.3390/SYM10010024zbMATH Open1391.90367OpenAlexW2784053604MaRDI QIDQ1646261FDOQ1646261
Authors: José Juan Carreño, José Antonio Martínez, M. L. Puertas 
Publication date: 25 June 2018
Published in: Symmetry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/sym10010024
Recommendations
- Optimization of resource location in hierarchical computer networks
- Quasi-perfect resource placements for two-dimensional toroidal networks
- Resource placement in Cartesian product of networks
- scientific article; zbMATH DE number 3845637
- Optimal location of a path or tree on a network with cycles
- On hub location problems in geographically flexible networks
- Optimal routing in toroidal networks
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Perfect codes in graphs
- On the efficiency index of a graph
- Graphs \& digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The domination number of grids
- Independent \([1,k]\)-sets in graphs
- A note on the domination number of the Cartesian products of paths and cycles
- Independent domination of grids
- Independent [1,2]-domination of grids via min-plus algebra
- Domination of cylinder graphs
Cited In (3)
Uses Software
This page was built for publication: Efficient location of resources in cylindrical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1646261)
