scientific article; zbMATH DE number 4115994

MaRDI QIDQ4730797zbMATH OpenFDO

Authors Sam M. Kim, Michael M. Skolnick, Kee-Youn Yoo

Publication date 1986

zbMATH Keywords

Gabriel graphmesh-connected computer

Mathematics Subject Classification ID

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

Recommendations

• Parallel algorithms for a class of graphs generated recursively
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Parallelizing sequential graph computations
• Efficient Computation of Elliptic Gabriel Graph
• Parallel algorithms for series parallel graphs
• Parallel algorithms for cographs and parity graphs with applications
• On greedy algorithms for series parallel graphs
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
• Parallel algorithms for connectivity problems in graph theory
• Parallel algorithms for permutation graphs

Cited in

(4)

• Optimal and suboptimal robust algorithms for proximity graphs
• Convex hulls and metric Gabriel graphs
• Efficient Computation of Elliptic Gabriel Graph
• Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation

This page was built for publication:

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