Efficient algorithms for network localization using cores of underlying graphs
type: Item
instance of: scholarly article
title: Efficient algorithms for network localization using cores of underlying graphs
zbMATH Open document ID: 1360.68649
author: Meng Li
author: Yota Otachi
author: Takeshi Tokuyama
published in: Theoretical Computer Science
publication date: 2014-09-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6345740
zbMATH Keywords: network localization
zbMATH Keywords: point set reconstruction
zbMATH Keywords: weighted graph embedding
zbMATH Keywords: graph turnpike problem
zbMATH Keywords: chordal graph
zbMATH Keywords: connected dominating set
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.02.020
OpenAlex ID: W2177765211
cites work: Approximating the tree and tour covers of a graph
cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas
cites work: The complexity of minimizing wire lengths in VLSI layouts
cites work: Unit disk graphs
cites work: Complement reducible graphs
cites work: Upper bounds to the clique width of graphs
cites work: Cutting up is hard to do: the parameterised complexity of \(k\)-cut and related problems
cites work: Q4393480
cites work: On the graph turnpike problem
cites work: Incidence matrices and interval graphs
cites work: Q4198056
cites work: Algorithmic graph theory and perfect graphs
cites work: Q4279195
cites work: Parameterized complexity of Vertex Cover variants
cites work: Q5572939
cites work: Connected rigidity matroids and unique realizations of graphs
cites work: On graphs and rigidity of plane skeletal structures
cites work: Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems
cites work: Algorithmic Aspects of Vertex Elimination on Graphs
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
DOI: 10.1016/J.TCS.2014.02.020
Recommended article: A Computational Geometry Framework for Efficient Network Localization
Recommended article: Q3316922
Recommended article: Q4934873
Recommended article: Some new algorithms for location problems on networks
Recommended article: An Axiomatic Approach to Location on Networks
Recommended article: A Diffusion Approach to Network Localization
Recommended article: An algorithm for locating propagation source in complex networks
description: scientific article; zbMATH DE number 6345740