Sciweavers

253 search results - page 18 / 51
» Testing subgraphs in directed graphs
Sort
View
BMCBI
2008
208views more  BMCBI 2008»
13 years 10 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
FORTE
1998
13 years 11 months ago
Issues in conformance testing: multiple semicontrollable interfaces
In a testing environment, where an IUT communicates with multiple entities, a tester may have di ering degrees of controllability on the interactions between these entities and th...
Mariusz A. Fecko, M. Ümit Uyar, Adarshpal S. ...
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 4 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
DAM
2010
81views more  DAM 2010»
13 years 10 months ago
The k-in-a-tree problem for graphs of girth at least k
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
W. Liu, Nicolas Trotignon
STACS
2007
Springer
14 years 4 months ago
Testing Convexity Properties of Tree Colorings
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
Eldar Fischer, Orly Yahalom