Skip to main content
Share Your Experience: Take the 2024 Developer Survey

Questions tagged [triangulation]

The tag has no usage guidance.

Filter by
Sorted by
Tagged with
2 votes
2 answers

property of minimal triangulations

A graph is chordal if every cycle on four or more vertices contains a chord i.e. an edge between non-adjacent vertices of the cycle. A triangulation (or chordalization) of a graph $G=(V,E)$ is the ...
CuriousChordalizer's user avatar
2 votes
0 answers

Complexity of finding a room-partitioning

In a paper by Jack Edmonds and Laura Sanità (link: the following intriguing result is given: Given a triangulation $T$ of $3n$ ...
László Kozma's user avatar