Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a detailed survey of proposed main-memory solutions

continuous level-of-detail representation for an object is first constructed off-line. This representation is then used at run-time to guide the selection of appropriate triangles for display. The list of displayed triangles is updated incrementally from one frame to the next. Our approach is more effective

We describe several algorithms for the generation of integer Heronian triangles with diameter at most n. Two of them have running time O `n2+ε´. We enumerate all integer Heronian triangles for n ≤ 600000 and apply the complete list on some related problems.

In Arnold’s classification list of singularities (Arnold [1].) we find interesting singularities to be studied. Though we find singularities of any dimension in Arnold’s list, we consider singularities of dimension two in particular. Among them there is a class called exceptional singularities

of renderers; there is no fundamental limit to the maximum performance achievable using this approach. A single PixelFlow renderer rasterizes up to 1.4 million triangles per second, and an n-renderer system can rasterize at up to n times this basic rate. PixelFlow performs antialiasing by supersampling

is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.

© 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other

In 1995, Voigt constructed a planar triangle-free graph that is not 3-list-colorable. It has 166 vertices. Gutner then constructed such a graph with 164 vertices. We present two more graphs with these properties. The first graph has 97 vertices and a failing list assignment using triples from a set

It is with due submission, a humble sense of relief, gratitude, achievement and appreciation that I compile this page. The list of persons to thank is extensive and I mention the names in no particular order of priority. I wish to express my sincere gratitude: To the Almighty God, our Heavenly

weight. • Listing up to n 2.99 negative triangles in an edge-weighted graph. • Finding a minimum weight cycle in a graph of non-negative edge weights. • The replacement paths problem on weighted digraphs. • Finding the second shortest simple path between two nodes in a weighted digraph. • Checking