199 search results - page 9 / 40 » Connectivity of addable graph classes |
TVCG
2012
11 years 10 months ago
2012
—The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the ...
CAI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In this paper we examine spectral properties of random intersection graphs when the number of vertices is equal to the number of labels. We call this class symmetric rand...
GC
2007
Springer
13 years 7 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
CPC
2011
13 years 2 months ago
2011
We study a problem on edge percolation on product graphs G× K2. Here G is any finite graph and K2 consists of two vertices {0, 1} connected by an edge. Every edge in G × K2 is p...
JMIV
2008
13 years 7 months ago
2008
Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In this paper, we consider a segmentation as a set of connected r...