Searching for "On Triangulating Planar Graphs under the Four-Connectivity Constraint." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Om Triangulating Planar Graphs under the Four-Connectivity Constraint
by T. Biedl, T. Biedl, G. Kant, G. Kant, M. Kaufmann, M. Kaufmann, Therese Biedl, Goos Kant, Michael Kaufmann — 1995 — Algorithmica
…On Triangulating Planar Graphs under the Four-Connectivity Constraint T. Biedl, G. Kant and M…
Add To MetaCart

On Triangulating Planar Graphs Under the Four-Connectivity Constraint
by Therese C. Biedl, Goos Kant, and Michael Kaufmann, T. Biedl, G. Kant, M. Kaufmann — 1997
… triangles is NP-complete. On Triangulating Planar Graphs under the Four-Connectivity Constraint 435 Fig. 3…
Cited by 14 (2 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB