Spanners of Complete k-Partite Geometric Graphs

DOI10.1007/978-3-540-78773-0_15zbMATH Open1136.68449OpenAlexW2741229744MaRDI QIDQ5458526FDOQ5458526

Authors: Prosenjit Bose, Paz Carmi, M. Couture, Anil Maheshwari, Pat Morin, Michiel Smid 

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_15

Recommendations

• Spanners of Complete k-Partite Geometric Graphs
• On Spanners of Geometric Graphs
• On Spanners of Geometric Graphs
• ON SPANNERS OF GEOMETRIC GRAPHS
• On spanners and lightweight spanners of geometric graphs
• Spanners for geometric intersection graphs with applications
• Spanning trees in multipartite geometric graphs
• Spanners for Geometric Intersection Graphs
• Spanners for geodesic graphs and visibility graphs
• Spanners in graphs of bounded degree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Geometric Spanner Networks
• On sparse spanners of weighted graphs
• A sparse graph almost as good as the complete graph on points in \(k\) dimensions
• On Spanners of Geometric Graphs
• A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
• Title not available (Why is that?)
• CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS

Cited In (6)

• Geometric spanners with small chromatic number
• Spanners of Complete k-Partite Geometric Graphs
• On the power of the semi-separated pair decomposition
• ON SPANNERS OF GEOMETRIC GRAPHS
• Title not available (Why is that?)
• On the Power of the Semi-Separated Pair Decomposition

This page was built for publication: Spanners of Complete k-Partite Geometric Graphs

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