Sciweavers

1756 search results - page 84 / 352
» Directed scale-free graphs
Sort
View
AAAI
2004
13 years 9 months ago
A General Solution to the Graph History Interaction Problem
Since the state space of most games is a directed graph, many game-playing systems detect repeated positions with a transposition table. This approach can reduce search effort by ...
Akihiro Kishimoto, Martin Müller 0003
APVIS
2001
13 years 9 months ago
Information Visualisation using Composable Layouts and Visual Sets
This paper demonstrates the application of graph drawing and information visualisation techniques to the visualisation of information which can be modelled as an attributed graph....
Tim Pattison, Rudi Vernik, Matthew Phillips
ECEASST
2006
305views more  ECEASST 2006»
13 years 8 months ago
The ParMol Package for Frequent Subgraph Mining
Mining for frequent subgraphs in a graph database has become a popular topic in the last years. Algorithms to solve this problem are used in chemoinformatics to find common molecul...
Thorsten Meinl, Marc Wörlein, Olga Urzova, In...
STACS
2010
Springer
14 years 3 months ago
Log-space Algorithms for Paths and Matchings in k-trees
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
DILS
2006
Springer
13 years 11 months ago
On Querying OBO Ontologies Using a DAG Pattern Query Language
The Open Biomedical Ontologies (OBO) is a consortium that serves as a repository of ontologies that are structured like directed acyclic graphs. In this paper we present a language...
Amarnath Gupta, Simone Santini