250 search results - page 6 / 50 » Constructing a Class of Symmetric Graphs |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
New (96, 20, 4)-symmetric design has been constructed, unique under the assumption of an automorphism group of order 576 action. The correspondence between a (96, 20, 4)-symmetric ...
TVCG
2012
11 years 11 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 ...
CC
1998
Springer
13 years 8 months ago
1998
Springer
We introduce the natural class SP 2 containing those languages which may be expressed in terms of two symmetric quanti ers. This class lies between P 2 and P 2 P 2 and naturall...
ECCC
2007
13 years 8 months ago
2007
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...