Sciweavers

4865 search results - page 285 / 973
» The Complexity of Graph Connectivity
Sort
View
ICSE
2008
IEEE-ACM
16 years 7 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
WDAG
2005
Springer
130views Algorithms» more  WDAG 2005»
16 years 4 days ago
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger...
ICFCA
2004
Springer
16 years 1 days ago
Background Knowledge in Concept Graphs
Traditional logic can be understood as the investigation of the three main essential functions of thinking – concepts, judgements and conclusions. In the last years, in a new res...
Frithjof Dau
GBRPR
2009
Springer
15 years 11 months ago
A Recursive Embedding Approach to Median Graph Computation
The median graph has been shown to be a good choice to infer a representative of a set of graphs. It has been successfully applied to graph-based classification and clustering. Ne...
Miquel Ferrer, Dimosthenis Karatzas, Ernest Valven...
PODS
1993
ACM
161views Database» more  PODS 1993»
15 years 10 months ago
Blocking for External Graph Searching
In this paper we consider the problem of using disk blocks efficiently in searching graphs that are too large to fit in internal memory. Our model allows a vertex to be represented...
Mark H. Nodine, Michael T. Goodrich, Jeffrey Scott...