Results 1  10
of
859
Edgebreaker: Connectivity compression for triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits to store ..."
Abstract

Cited by 298 (24 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called connectivity or topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case storage required by previously reported schemes, most of which require O(nlogn) bits
Edgebreaker: Compressing the incidence graph of triangle meshes
 IEEE Transactions on Visualization and Computer Graphics
, 1999
"... Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits to sto ..."
Abstract

Cited by 11 (7 self)
 Add to MetaCart
Edgebreaker is a simple scheme for compressing the triangle/vertex incidence graphs (sometimes called topology) of threedimensional triangle meshes. Edgebreaker improves upon the worst case and the expected compression ratios of previously reported schemes, most of which require O(nlogn) bits
Counting Triangles in Data Streams
, 2006
"... We present two space bounded random sampling algorithms that compute an approximation of the number of triangles in an undirected graph given as a stream of edges. Our first algorithm does not make any assumptions on the order of edges in the stream. It uses space that is inversely related to the ra ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
to the ratio between the number of triangles and the number of triples with at least one edge in the induced subgraph, and constant expected update time per edge. Our second algorithm is designed for incidence streams (all edges incident to the same vertex appear consecutively). It uses space that is inversely
On Vertex Orderings and the Stability Number in trianglefree Graphs
"... Given an ordering of the vertices of a graph one can construct a maximal stable set of that graph applying a simple greedy algorithm. By investigating certain conditions on the orderings of the vertices, N.V.R. Mahadev and B.A. Reed [5] characterized a class of graphs for which a maximum stable set ..."
Abstract
 Add to MetaCart
set and hence also the stability number can be computed in polynomial time in this way. In this paper we give a partial answer to a question raised by them in [5] by characterizing all trianglefree graphs for which vertex orderings satisfying a certain condition yield a maximum stable set
Efficient Triangle Counting in Large Graphs via Degreebased Vertex Partitioning
"... The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important real world applications such as spam detection, uncovering t ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
The number of triangles is a computationally expensive graph statistic which is frequently used in complex network analysis (e.g., transitivity ratio), in various random graph models (e.g., exponential random graph model) and in important real world applications such as spam detection, uncovering
Triangle Factors in Random Graphs
 Combin. Probab. Comput
, 2001
"... For a graph G = (V; E) on n vertices, where 3 divides n, a triangle factor is a subgraph of G, consisting of n=3 vertex disjoint triangles (complete graphs on three vertices). We discuss the problem of determining the minimal probability p = p(n), for which a random graph G 2 G(n; p) contains al ..."
Abstract

Cited by 14 (1 self)
 Add to MetaCart
For a graph G = (V; E) on n vertices, where 3 divides n, a triangle factor is a subgraph of G, consisting of n=3 vertex disjoint triangles (complete graphs on three vertices). We discuss the problem of determining the minimal probability p = p(n), for which a random graph G 2 G(n; p) contains
Vertex distinguishing colorings of graphs with
 G) = 2, Discrete Mathematics 252(2002)17 ∼ 29
"... In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) required to proper edgecolor G so that each vertex has a distinct set of colors incident to it. We consider the case when ∆(G) = 2, so that G is a union of paths and cycles. In particular we find the ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
In a paper by Burris and Schelp [3], a conjecture was made concerning the number of colors χ′s(G) required to proper edgecolor G so that each vertex has a distinct set of colors incident to it. We consider the case when ∆(G) = 2, so that G is a union of paths and cycles. In particular we find
Extremal Graphs for Intersecting Triangles
"... It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. 1 ..."
Abstract
 Add to MetaCart
It is known that for a graph on n vertices bn2/4c + 1 edges is sufficient for the existence of many triangles. In this paper, we determine the minimum number of edges sufficient for the existence of k triangles intersecting in exactly one common vertex. 1
Triangle factors of graphs without large independent sets and of weighted graphs
, 2015
"... The classical CorrádiHajnal theorem claims that every nvertex graph G with δ(G) ≥ 2n/3 contains a triangle factor, when 3n. In this paper we asymptotically determine the minimum degree condition necessary to guarantee a triangle factor in graphs with sublinear independence number. In particular ..."
Abstract
 Add to MetaCart
The classical CorrádiHajnal theorem claims that every nvertex graph G with δ(G) ≥ 2n/3 contains a triangle factor, when 3n. In this paper we asymptotically determine the minimum degree condition necessary to guarantee a triangle factor in graphs with sublinear independence number
Results 1  10
of
859