28 search results - page 2 / 6 » Counting Plane Graphs: Flippability and its Applications |
123
Voted
SODA
2007
ACM
15 years 2 months ago
2007
ACM
We introduce a general method to count and randomly sample unlabeled combinatorial structures. The approach is based on pointing unlabeled structures in an “unbiased” way, i.e...
121
Voted
GD
2005
Springer
15 years 6 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
123
Voted
DMTCS
2010
14 years 10 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
105
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
124
Voted
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
We introduce a new type of diagram called the VV(c)-diagram (the visibility–Voronoi diagram for clearance c), which is a hybrid between the visibility graph and the Voronoi diag...