Sciweavers

253 search results - page 33 / 51
» Testing subgraphs in directed graphs
Sort
View
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
14 years 4 months ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...
CONCUR
2003
Springer
14 years 3 months ago
A Compositional Semantic Theory for Synchronous Component-based Design
Abstract. Digital signal processing and control (DSPC) tools allow application developers to assemble systems by connecting predefined components in signal–flow graphs and by h...
Barry Norton, Gerald Lüttgen, Michael Mendler
GECCO
2006
Springer
148views Optimization» more  GECCO 2006»
14 years 1 months ago
An effective genetic algorithm for the minimum-label spanning tree problem
Given a connected, undirected graph G with labeled edges, the minimum-label spanning tree problem seeks a spanning tree on G to whose edges are attached the smallest possible numb...
Jeremiah Nummela, Bryant A. Julstrom
PKDD
2010
Springer
194views Data Mining» more  PKDD 2010»
13 years 7 months ago
Weighted Symbols-Based Edit Distance for String-Structured Image Classification
As an alternative to vector representations, a recent trend in image classification suggests to integrate additional structural information in the description of images in order to...
Cécile Barat, Christophe Ducottet, É...
MFCS
2007
Springer
14 years 4 months ago
Hardness Results for Tournament Isomorphism and Automorphism
A tournament is a graph in which each pair of distinct vertices is connected by exactly one directed edge. Tournaments are an important graph class, for which isomorphism testing ...
Fabian Wagner