Sciweavers

136 search results - page 8 / 28
» On Touching Triangle Graphs
Sort
View
COMBINATORICA
2004
44views more  COMBINATORICA 2004»
14 years 9 months ago
Triangle Factors In Sparse Pseudo-Random Graphs
Michael Krivelevich, Benny Sudakov, Tibor Szab&oac...
COMBINATORICS
1998
64views more  COMBINATORICS 1998»
14 years 9 months ago
Another Infinite Sequence of Dense Triangle-Free Graphs
Stephan Brandt, Tomaz Pisanski
CORR
2010
Springer
46views Education» more  CORR 2010»
14 years 6 months ago
Efficient Triangle Counting in Large Graphs via Degree-based Vertex Partitioning
Mihail N. Kolountzakis, Gary L. Miller, Richard Pe...
62
Voted
LATIN
2010
Springer
15 years 4 months ago
Optimal Polygonal Representation of Planar Graphs
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
Emden R. Gansner, Yifan Hu, Michael Kaufmann, Step...
74
Voted
COMPGEOM
2004
ACM
15 years 3 months ago
Single-strip triangulation of manifolds with arbitrary topology
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
David Eppstein, M. Gopi