Sciweavers

250 search results - page 6 / 50
» Constructing a Class of Symmetric Graphs
Sort
View
SODA
2012
ACM
213views Algorithms» more  SODA 2012»
13 years 2 months ago
Expanders are universal for the class of all spanning trees
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 ...
Daniel Johannsen, Michael Krivelevich, Wojciech Sa...
DCC
2005
IEEE
15 years 11 months ago
One (96, 20, 4)-symmetric Design and related Nonabelian Difference Sets
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 ...
Anka Golemac, Tanja Vucicic, Josko Mandic
TVCG
2012
184views Hardware» more  TVCG 2012»
13 years 2 months ago
Output-Sensitive Construction of Reeb Graphs
—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 ...
Harish Doraiswamy, Vijay Natarajan
85
Voted
CC
1998
Springer
100views System Software» more  CC 1998»
14 years 11 months ago
Symmetric Alternation Captures BPP
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...
Alexander Russell, Ravi Sundaram
ECCC
2007
69views more  ECCC 2007»
14 years 11 months ago
Testing Symmetric Properties of Distributions
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 ...
Paul Valiant