Sciweavers

42 search results - page 2 / 9
» Combinatorial characterization of the Assur graphs from engi...
Sort
View
SIAMCOMP
2011
13 years 2 months ago
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
Reingold, Vadhan and Wigderson [21] introduced the graph zig-zag product. This product combines a large graph and a small graph into one graph, such that the resulting graph inher...
Avraham Ben-Aroya, Amnon Ta-Shma
ECCC
1998
117views more  ECCC 1998»
13 years 7 months ago
Determinant: Old Algorithms, New Insights
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
Meena Mahajan, V. Vinay
SCAM
2002
IEEE
14 years 13 days ago
Semantics Guided Filtering of Combinatorial Graph Transformations in Declarative Equation-Based Languages
This paper concerns the use of static analysis for debugging purposes of declarative object-oriented equation-based modeling languages. We propose a framework where over- and unde...
Peter Bunus, Peter Fritzson
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
13 years 9 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
ICSE
2008
IEEE-ACM
14 years 8 months ago
Predicting defects using network analysis on dependency graphs
In software development, resources for quality assurance are limited by time and by cost. In order to allocate resources effectively, managers need to rely on their experience bac...
Thomas Zimmermann, Nachiappan Nagappan