On the planarization of wireless sensor networks

DOI10.1007/S00453-010-9476-ZMaRDI QIDQ548669zbMATHOpenAlexFDO

Authors Fenghui Zhang, Anxiao (Andrew) Jiang, Jianer Chen

Publication date 30 June 2011

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-010-9476-z

zbMATH Keywords

approximation algorithmgraph drawingsensor networkparameterized algorithmbipartite planarizationnetwork planarization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Mathematical problems of computer architecture (68M07)

Recommendations

• Network sketching or: ``How much geometry hides in connectivity? II
• Geometric algorithms for sensor networks
• Packing short plane spanning trees in complete geometric graphs
• An analysis of heuristics for graph planarization
• Packing plane spanning graphs with short edges in complete geometric graphs

Cites work

• scientific article; zbMATH DE number 2084262 (Why is no real title available?)
• scientific article; zbMATH DE number 2086259 (Why is no real title available?)
• scientific article; zbMATH DE number 5506229 (Why is no real title available?)
• Drawing graphs in two layers
• Network sketching or: ``How much geometry hides in connectivity? II
• Vertex cover: Further observations and further improvements

This page was built for publication: On the planarization of wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548669)