Sciweavers

3105 search results - page 41 / 621
» The Path-Packing Structure of Graphs
Sort
View
98
Voted
ICFEM
2009
Springer
15 years 5 months ago
An Empirical Study of Structural Constraint Solving Techniques
Structural constraint solving allows finding object graphs that satisfy given constraints, thereby enabling software reliability tasks, such as systematic testing and error recove...
Junaid Haroon Siddiqui, Sarfraz Khurshid
111
Voted
ICPR
2010
IEEE
15 years 3 months ago
Kernel-Based Implicit Regularization of Structured Objects
Weighted graph regularization provides a rich framework that allows to regularize functions defined over the vertices of a weighted graph. Until now, such a framework has been only...
François-Xavier Dupé, Sébastien Bougleux, Luc B...
WCRE
2008
IEEE
15 years 7 months ago
Graph-Centric Tools for Understanding the Evolution and Relationships of Software Structures
We present a suite of small tools, implemented as a pipeline of text file manipulating scripts, that, on one hand, measure the evolution of any software structure that can be rep...
Yijun Yu, Michel Wermelinger
86
Voted
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 21 days ago
Approximate Shortest Paths Avoiding a Failed Vertex: Optimal Size Data Structures for Unweighted Graph
Let G = (V, E) be any undirected graph on V vertices and E edges. A path P between any two vertices u, v V is said to be t-approximate shortest path if its length is at most t tim...
Neelesh Khanna Surender Baswana
213
Voted
ICDE
2007
IEEE
167views Database» more  ICDE 2007»
16 years 1 months ago
GString: A Novel Approach for Efficient Search in Graph Databases
Graphs are widely used for modeling complicated data, including chemical compounds, protein interactions, XML documents, and multimedia. Information retrieval against such data ca...
Haoliang Jiang, Haixun Wang, Philip S. Yu, Shuigen...