Source detection on graphs
From MaRDI portal
Publication:6640145
DOI10.1007/s11081-023-09869-xMaRDI QIDQ6640145
Volker Kaibel, Tobias Weber, Sebastian Sager
Publication date: 18 November 2024
Published in: Optimization and Engineering (Search for Journal in Brave)
Linear inference, regression (62Jxx) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Mathematical programming (90Cxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation complexity of metric dimension problem
- Computing minimal doubly resolving sets of graphs
- Resolvability in graphs and the metric dimension of a graph
- Optimal vaccination policies for stochastic epidemics among a population of households
- Genetic and hybrid algorithms for graph coloring
- Landmarks in graphs
- Metric Dimension Parameterized by Max Leaf Number
- Metric Dimension of Bounded Width Graphs
- Optimum Designs in Regression Problems
- On the Metric Dimension of Cartesian Products of Graphs
- Extremal Graph Theory for Metric Dimension and Diameter
- Regression
- Metric bases in digital geometry
- A graph coloring algorithm for large scheduling problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Exact and Approximate Solutions of Source Localization Problems
- Applied Linear Regression
- Collective dynamics of ‘small-world’ networks
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Optimum Allocation in Linear Regression Theory
- On the Efficient Design of Statistical Investigations
- Getting the Lay of the Land in Discrete Space: A Survey of Metric Dimension and Its Applications
This page was built for publication: Source detection on graphs
