Sciweavers

217 search results - page 15 / 44
» Constructing Incremental Sequences in Graphs
Sort
View
SIAMDM
2008
84views more  SIAMDM 2008»
13 years 8 months ago
Long Local Searches for Maximal Bipartite Subgraphs
Given a partition of the vertices of a graph into two sets, a flip is a move of a vertex from its own set to the other, under the condition that it has more incident edges to vert...
Hemanshu Kaul, Douglas B. West
BMCBI
2006
127views more  BMCBI 2006»
13 years 8 months ago
Construction of phylogenetic trees by kernel-based comparative analysis of metabolic networks
Background: To infer the tree of life requires knowledge of the common characteristics of each species descended from a common ancestor as the measuring criteria and a method to c...
Sok June Oh, Je-Gun Joung, Jeong Ho Chang, Byoung-...
ATAL
2005
Springer
14 years 2 months ago
Discovering strategic multi-agent behavior in a robotic soccer domain
2. THE MASM ALGORITHM An input to the MASM algorithm is a time-annotated multi-agent action sequence. The action sequence is then transformed into an action graph. An action graph ...
Andraz Bezek
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 1 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
GG
2004
Springer
14 years 2 months ago
Event-Driven Grammars: Towards the Integration of Meta-modelling and Graph Transformation
In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta-modelling. Rules in these g...
Esther Guerra, Juan de Lara