On the planarization of wireless sensor networks

DOI10.1007/S00453-010-9476-ZzbMATH Open1218.68034OpenAlexW1968150002MaRDI QIDQ548669FDOQ548669

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

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

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)

Cites Work

• Title not available (Why is that?)
• Vertex cover: Further observations and further improvements
• Drawing graphs in two layers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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)