Sciweavers

139 search results - page 13 / 28
» Introduction to Testing Graph Properties
Sort
View
CORR
2010
Springer
108views Education» more  CORR 2010»
13 years 3 months ago
Finding Cycles and Trees in Sublinear Time
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
Artur Czumaj, Oded Goldreich, Dana Ron, C. Seshadh...
CORR
2006
Springer
102views Education» more  CORR 2006»
13 years 8 months ago
Structural Inference of Hierarchies in Networks
One property of networks that has received comparatively little attention is hierarchy, i.e., the property of having vertices that cluster together in groups, which then join to f...
Aaron Clauset, Cristopher Moore, M. E. J. Newman
ICST
2009
IEEE
14 years 3 months ago
Optimizing Generation of Object Graphs in Java PathFinder
Java PathFinder (JPF) is a popular model checker for Java programs. JPF was used to generate object graphs as test inputs for object-oriented programs. Specifically, JPF was used...
Milos Gligoric, Tihomir Gvero, Steven Lauterburg, ...
IPCO
2008
221views Optimization» more  IPCO 2008»
13 years 10 months ago
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem
Abstract. Semidefinite relaxations are known to deliver good approximations for combinatorial optimization problems like graph bisection. Using the spectral bundle method it is pos...
Michael Armbruster, Marzena Fügenschuh, Chris...
FUZZY
2001
Springer
123views Fuzzy Logic» more  FUZZY 2001»
14 years 1 months ago
Analyzing Directed Acyclic Graph Recombination
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation...
Carlos Cotta, José M. Troya